Approximating Voronoi Diagrams of Convex Sites in any Dimension

@article{Vleugels1998ApproximatingVD,
  title={Approximating Voronoi Diagrams of Convex Sites in any Dimension},
  author={Jules Vleugels and Mark H. Overmars},
  journal={Int. J. Comput. Geometry Appl.},
  year={1998},
  volume={8},
  pages={201-222}
}
Generalized Voronoi diagrams of objects are difficult to compute in a robust way, especially in higher dimensions. For a number of applications an approximation of the real diagram within some predetermined precision is sufficient. In this paper we study the computation of such approximate Voronoi diagrams. The emphasis is on practical applicability, therefore we are mainly concerned with fast (in terms of running time) computation, generality, robustness, and easy implementation, rather than… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

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

PlaGeo/SpaGeo—A Library for Planar/Spatial Geometry

  • Geert-Jan Giezeman
  • Dept. Comput. Sci., Utrecht Univ., Utrecht, the…
  • 1994

Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic,

  • K. Sugihara, M. Iri
  • Proc. IEEE,
  • 1992

Numerically robust incremental algorithm for constructing three-dimensional Voronoi diagrams,

  • Hiroshi Inagaki, Kokichi Sugihara, Noboru Sugie
  • In Proc. 4th Ganad. Conf. Comput. Geom.,
  • 1992

Spatial Tessellations: Concepts and Applications of Voronoi Diagrams

  • Atsuyuki Okabe, Barry Boots, Kokichi Sugihara
  • 1992

Similar Papers

Loading similar papers…