Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements

@article{Mulmuley1993OutputSA,
  title={Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements},
  author={Ketan Mulmuley},
  journal={J. Comput. Syst. Sci.},
  year={1993},
  volume={47},
  pages={437-458}
}
We give efficient, output sensitive algorithms to construct Voronoi diagrams of order one to k of a given collection of sites in Rd and levels of order one to k in a nonredundant arrangement of hyperplanes in Rd (an arrangement is called nonredundant if every hyperplane in it supports the convex polytope of the arrangement surrounding the origin). We also give efficient dynamic algorithms for the same problems that allow the user to add or delete an object-the object being a site in the case of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

On Levels in Arrangement and Voronoi Diagrams

Discrete & Computational Geometry • 1991
View 10 Excerpts

WELZL , enets and simplex range querries , Discrete Comput

E. D.HAUSSLERAND
Geom . • 1990

SHOR, A linear time algorithm for computing the Voronoi diagram of a convex polygon

A. AGARWAL, L. GUIBAS, J. SUE
Discrefe Comput. Geom • 1989

SHOR, Applications of random sampling in computational geometry, II

P. K. CLARKXN
Discrete Comput. Geom • 1989

Similar Papers

Loading similar papers…