16th Annual Symposium on Foundations of Computerâ€¦

1975

A number of seemingly unrelated problems involving the proximity of N points in the plane are studied, such as finding a Euclidean minimum spanning tree, the smallest circle enclosing the set, kâ€¦ (More)

We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a singleâ€¦ (More)

17th Annual Symposium on Foundations of Computerâ€¦

1976

We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout.â€¦ (More)

[Tou] Toussaint, G., " A hierarchy of simple polygons, " manuscript in preparation. Determining the castability of simple polyhedra, " manuscript in preparation. Mould design with sweep operations-aâ€¦ (More)

The complexity of a number of fundamental problems in computational geometry is examined and a number of new fast algorithms are presented and analyzed. General methods for obtaining results inâ€¦ (More)

17th Annual Symposium on Foundations of Computerâ€¦

1976

We employ elementary results from the theory of several complex variables to obtain a quadratic lower bound on the complexity of computing the mean distance between points in the plane. This problemâ€¦ (More)

Emergent computation in the form of geometric learning is central to the development of motor and perceptual systems in biological organisms and promises to have a similar impact on emergingâ€¦ (More)

In this paper we approach the analysis of statistics algorithms from a geometric viewpoint and use techniques from computational geometry to develop new, fast algorithms for computing familiarâ€¦ (More)