Order-fc voronoi diagrams, fc-sections, and k-sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1763, Issue , 2000, Pages 290-304

  Schmitt, Dominique ^a   Spehner, Jean Claude ^a  

^a UNIVERSITÉ DE HAUTE ALSACE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

ORDER-K VORONOI DIAGRAMS; PRECISE DEFINITION; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 84947798741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46515-7_26     Document Type: Conference Paper

References (10)

1. F. Aurenhammer. A criterion for the affine equivalence of cell complexes in Rd and convex polyhedra in Rd+1. Discrete Comput. Geom., 2:49-64, 1987.
2. F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345-405, 1991.
3. F. Aurenhammer and O. Schwarzkopf. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Internat. J. Comput. Geom. Appl., 2:363-381, 1992.
4. H. Edelsbrunner and R. Seidel. Voronoi diagrams and arrangements. Discrete Comput. Geom., 1:25-44, 1986.
5. D. T. Lee. On fc-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput., 31:478-487, 1982.
6. R. E. Miles. On the homogenous planar Poisson point-process. Math. Biosci., 6:85-127, 1970.
7. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley and Sons, Chichester, UK, 1992.
8. D. Schmitt. Sur les diagrammes de Delaunay et de Voronoi d’ordre k dans le plan et dans ľespace. Ph.D. thesis, Universitě de Haute-Alsace, Mulhouse, France, 1995.
9. D. Schmitt and J.-C. Spehner. On Delaunay and Voronoi diagrams of order k in the plane. In Proc. 3rd Canad. Conf. Comput. Geom., pages 29-32, 1991.
10. M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Annu. IEEE Sympos. Found. Comput. Sei., pages 151-162, 1975.