Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2000

2000

We present a deterministic algorithm for computing the diameter of a set of n points in R3; its running time O(n log n) is worst… Expand

Is this relevant?

1989

1989

Abstract : This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Linear-time algorithms for linear programming in R and R are presented. The methods used are applicable for other graphic and… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Linear-time for Linear Programming in R2 and R3 are presented. The methods used are applicable for some other problems. For… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight… Expand

Is this relevant?

1980

1980

Abstract Combinatorial techniques are used to solve recurrence relations in two variables of the form T(N, k) = 2T( N 2 , k) + T… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

The problem of construction of planar Voronoi diagrams arises in many areas, one of the most important of which is in nearest… Expand

Is this relevant?

Highly Cited

1979