Helmut Alt
Otfried Schwarzkopf
- 1.F. Aurenhammer. Voronoi diagrams: a survey of a fundamental geometric data structure. A CM Cornput. $urv., 23:345-405, 1991. Google Scholar
Digital Library
- 2.j.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom., 8:51-71, 1992. Google ScholarDigital Library
- 3.L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1986. Google ScholarDigital Library
- 4.K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.Google ScholarDigital Library
- 5.R. Klein. Abstract Voronoi diagrams and their applications. In Computational Geometry and its Applications, volume 333 of Lecture Notes in Computer Science, pages 148-157. Springer-Verlag, 1988. Google ScholarCross Ref
- 6.R. Klein. Concrete and Abstract Voronoi Diagrams, volume 400 of Lecture Notes in Computer Science. Springer-Verlag, 1989.Google Scholar
- 7.R. Klein, K. Mehlhorn, and S. Meiser. Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl., 3(3):157- 184, 1993. Google ScholarDigital Library
- 8.R. Klein and D. Wood. Voronoi Diagrams and Mixed Metrics. Proc. 5th Sympos. Theoret. Aspects Comput. Sci. (STACS), Lecture Notes in Computer Science 294, Springer-Verlag 1988, 281- 291. Google ScholarDigital Library
- 9.D. Leven and M. Sharir. Planning a purely translational motion for a convex object in twodimensional space using generalized Voronoi diagrams. Discrete Comput. Geom., 2:9-31, 1987.Google ScholarDigital Library
- 10.D. E. Muller and F. P. Preparata. Finding the intersection of two convex polyhedra. Theoret. Cornput. $ci., 7:217-236, 1978.Google Scholar
- 11.K. Mulmuley. A fast planar partition algorithm, I. in Proc. 29th A nnu. IEEE Sympos. Found. Cornput. Sci., pages 580-589, 1988.Google ScholarDigital Library
- 12.C. O'Ddnlaing and C. K. Yap. A "retraction" method for planning the motion of a disk. J. Algorithms, 6:104-111, 1985.Google ScholarCross Ref
- 13.A.Okabe, B. Boots, and K. Sughihara. Spatial Tesselations: Concepts and Applications of Voronoi diagrams. J. Wiley & Sons, 1992. Google ScholarDigital Library
- 14.F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985. Google ScholarDigital Library
- 15.R. Seidel. Backwards analysis of randomized geometric algorithms. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 37-68. Springer-Verlag, 1993.Google Scholar
- 16.J. J. Stoker. Differential Geometr.~. Wiley- Interscience, 1969.Google Scholar
- 17.C. K. Yap. An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom., 2:365-393, 1987.Google ScholarDigital Library
- 18.Chee K. Yap and Helmut Alt. Motion planning in the CL-environment. In Proc. 1st Workshop Algorithms Data $truct., volume 382 of Lecture Notes in Computer Science, pages 373-380, 1989. Google ScholarDigital Library
Index Terms
- The Voronoi diagram of curved objects
Recommendations
Voronoi diagram computations for planar NURBS curves
SPM '08: Proceedings of the 2008 ACM symposium on Solid and physical modelingWe present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves between pairs of planar curves. Our scheme is based on computing critical ...
Multiresolution remeshing using weighted centroidal voronoi diagram
ICCS'06: Proceedings of the 6th international conference on Computational Science - Volume Part IIWe present a novel method for multiresolution remeshing of irregular mesh. First, the original mesh (two-manifold any genus) is decomposed into several patches, each patch is homeomorphic to a 2D triangle. The goal of this decomposition process is that ...
Efficient computation of 3d clipped voronoi diagram
GMP'10: Proceedings of the 6th international conference on Advances in Geometric Modeling and ProcessingThe Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi ...
Comments