Constructing arrangements of lines and hyperplanes with applications

An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm is shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace queries, degeneracy testing, and finding the minimum volume simplex determined by a set of points.

[1]  Richard Pollack,et al.  A theorem of ordered duality , 1982 .

[2]  Herbert Edelsbrunner,et al.  On the Number of Line Separations of a Finite Set in the Plane , 1985, J. Comb. Theory, Ser. A.

[3]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[4]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[5]  P. Erdös,et al.  Dissection Graphs of Planar Point Sets , 1973 .

[6]  Kevin Q. Brown.  Geometric transforms for fast geometric algorithms , 1979 .

[7]  Dan E. Willard,et al.  Polygon Retrieval , 1982, SIAM journal on computing (Print).

[8]  G. Alexanderson,et al.  Simple Partitions of Space , 1978 .

[9]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[10]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[11]  Bernard Chazelle.  How to Search in History , 1983, FCT.

[12]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[13]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[14]  Arnold L. Rosenberg,et al.  Stabbing line segments , 1982, BIT.