Computability of partial Delaunay triangulation and Voronoi diagram

Electronic Notes in Theoretical Computer Science

Volumn 66, Issue , 2002, Pages 91-103

  Khanban, A A ^a   Edalat, A ^a   Lieutier, A ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b DASSAULT SYSTÈMES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; RECURSIVE FUNCTIONS; TRIANGULATION; TURING MACHINES;

GEOMETRIC ALGORITHMS; HAUSDOFF DISTANCE; PARTIAL DELAUNAY TRIANGULATION; PARTIAL VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 18944376965     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80381-5     Document Type: Conference Paper

References (19)

1. Aurenhammer F., Klein R. Voronoi diagrams. Sack J.-R., Urrutia J. Handbook of computational geometry. 1999;201-290
2. de Berg M., van Kreveld M., Overmars M., Schwarzkopf O. "Computational geometry, algorithms and applications" 2nd edition :2000;Springer
3. Desaulniers H., Stewart N.F. Robustness of numerical methods in geometric computation when problem data is uncertain. Computer-Aided Design, special issue on uncertainties in geometrical design. 25:1993;539-545
4. Edalat A. and A. Lieutier, Domain theory and differential calculus, submitted. Available from http://www.doc.ic.ac.uk/~ae.
5. Edalat A. and A. Lieutier, Foundation of a computable solid modeling, in: Proceedings of the fifth symposium on Solid modeling and applications, ACM Symposium on Solid Modeling and Applications, 1999, pp. 278-284.
6. Edalat A., A. Lieutier and E. Kashefi, The convex hull in a new model of computation, in: Proc. 13th Canad. Conf. Comput. Geom., 2001, pp. 93-96.
7. Edalat A., Sünderhauf P. A domain theoretic approach to computability on the real line. Theoretical Computer Science. 210:1998;73-98
8. Fortune S. Voronoi diagrams and Delaunay triangulations. Du D.-Z., Hwang F. Computing in Euclidean Geometry. lecture notes series on Comput :1992;193-233
9. Gavrilova M., Ratschek H., Rokne J.G. Exact computation of Delaunay and power triangulations. Reliable Computing. 6:2000;39-60
10. Karasick M., Lieber D., Nackman L.R. Efficient Delaunay triangulation using rational arithmetic. ACM Transcations on Graphics. 10:1991;71-91
11. Khanban, A. A., A. Edalat and A. Lieutier, Computability of partial Delaunay triangulation and Voronoi diagram, http://www.doc.ic.ac.uk/~khanban.
12. Khanban, A. A., A. Edalat and A. Lieutier, Delaunay triangulation and Voronoi diagram with imprecise input data, http://www.doc.ic.ac.uk/~khanban.
13. Moore R. Methods and applications of interval analysis. Ames W.F. SIAM Studies in Applied Mathematics. 1979;SIAM
14. Oishi Y., Sugihara K. Topology oriented divide-and-conquer algorithm for voroni diagrams. Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing. 57:1995;303-314
15. Peters, T. J., D. R. Ferguson, N. F. Stewart and P. S. Fussell, Algorithmic tolerances and semantics in data exchange, ACM Conference on Computational Geometry (1997).
16. Preparata F., Shamos M. "Computational Geometry: an introduction" 1985;Springer Verlag
17. Sugihara K., Iri M. A robust topology-oriented incremental algorithm for voroni diagrams. International Journal of Computational Geometry and Applications. 1994;179-228
18. Sugihara K., Y. Ooishi and T. Imai, Topology-oriented approach to robustness and its application to several Voronoi-diagram algorithms, in: Proc. 2nd Canad. Conf. Comput. Geom., 1990, pp. 36-39.
19. Weihrauch K. "Computability" EATCS Monographs on Theoretical Computer Science 9. 1987;Springer-Verlag