Voronoi diagrams and arrangements

作者: Herbert Edelsbrunner , Raimund Seidel

DOI: 10.1007/BF02187681

关键词:

摘要: … With this view it turns out that the standard Euclidean Voronoi … This fact can be uued to obtain new Voronoi Diagram … , or aa we call it, Voronoi Diagram. The formation rule for such a …

参考文章(28)
Paul Erdös, László Lovász, A Simmons, Ernst G Straus, None, Dissection Graphs of Planar Point Sets A Survey of Combinatorial Theory. pp. 139- 149 ,(1973) , 10.1016/B978-0-7204-2262-7.50018-1
Robert Lewis (Scot) Drysdale, Generalized voronoi diagrams and geometric searching. Stanford University. ,(1979)
B. Grünbaum, Arrangements and Spreads American Mathematical Society. ,vol. 10, ,(1972) , 10.1090/CBMS/010
Kevin Q Brown, Fast Intersection of Half Spaces. ,(1978)
Raimund Seidel, A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions University of British Columbia. ,(1981) , 10.14288/1.0051821
Kevin Quentin Brown, Geometric transforms for fast geometric algorithms Carnegie Mellon University. ,(1979)
H Edelsbrunner, E Welzl, On the number of line separations of a finite set in the plane Journal of Combinatorial Theory, Series A. ,vol. 38, pp. 15- 29 ,(1985) , 10.1016/0097-3165(85)90017-2
Kevin Q. Brown, Voronoi diagrams from convex hulls Information Processing Letters. ,vol. 9, pp. 223- 228 ,(1979) , 10.1016/0020-0190(79)90074-7
F.P. Preparata, D.E. Muller, Finding the intersection of n half-spaces in time O(n log n)☆ Theoretical Computer Science. ,vol. 8, pp. 45- 55 ,(1979) , 10.1016/0304-3975(79)90055-0
Hiroshi Imai, Masao Iri, Kazuo Murota, VORONOI DIAGRAM IN THE LAGUERRE GEOMETRY AND ITS APPLICATIONS SIAM Journal on Computing. ,vol. 14, pp. 93- 105 ,(1985) , 10.1137/0214006