Output sensitive construction of the delaunay triangulation of points lying in two planes

International Journal of Computational Geometry and Applications

Volumn 6, Issue 1, 1996, Pages 1-14

  Boissonnat, Jean Daniel ^a   Cérézo, André ^b   Devillers, Olivier ^a   Teillaud, Monique ^a  

^a INRIA   (France)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

Computerized Tomography; Delaunay triangulation; Hyperbolic distance; Output sensitive algorithms; Voronoi diagram

Indexed keywords

EID: 3142613928     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000022     Document Type: Article

References (19)

1. F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
2. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
3. F. Aurenhammer. Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345-405, 1991.
4. R. Seidel. Constiucting higher-dimensional convex hulls at logarithmic cost per face. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 404-413, 1986.
5. J. Matousek and O. Schwarzkopf. Linear optimization queries. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 16-25, 1992.
6. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
7. 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.
8. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the 3-d Delaunay triangulation of constrained sets of points. In Proc. 3rd Canad. Conf. Comput. Geom., pages 110-113, 1991.
9. H. Bruggesser and P. Mani. Shellable decompositions of cells and spheres. Math. Scand., 29:197-205, 1971.
10. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. manuscript.
11. J.-D. Boissonnat. Shape reconstruction from planar cross-sections. Comput. Vision Graph. Image Process., 44(1):1-29, October 1988.
12. F. Aurenhammer. Power diagrams: properties, algorithms and applications. SIAM J. Comput., 16:78-96, 1987.
13. H. S. M. Coxeter. Introduction to Geometry. Wiley, New York, NY, 1961.
14. D. Pedoe. Geometry, a comprehensive course. Dover Publications, New York, 1970.
15. O. Devillers, S. Meiser, and M. Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. In Proc. 4th Canad. Conf. Comput. Geom., pages 263-268, 1992.
16. L. J. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom., 2:175-193, 1987.
17. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165-194, 1989. Corrigendum in 42 (1991), 249-251.
18. A. F. Beardon. The Geometry of Discrete Groups. Graduate Texts in Mathematics. Springer-Verlag, 1983.
19. A. Cérézo. Le plan hyperbolique à pied, puis un bond dans l'espace. Publication pèdagogique 10, Dept. Math., Nice Univ., France, 1991.