Delaunay triangulation of imprecise points in linear time after preprocessing

Computational Geometry: Theory and Applications

Volumn 43, Issue 3, 2010, Pages 234-242

  Löffler, Maarten ^a   Snoeyink, Jack ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Data imprecision; Delaunay triangulation; Minimum spanning tree

Indexed keywords

EID: 84867958383     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.12.007     Document Type: Conference Paper

References (33)

1. M. Abellanas, F. Hurtado, and P.A. Ramos Structural tolerance and Delaunay triangulation Inf. Process. Lett. 71 5-6 1999 221 227
2. A. Aggarwal, L.J. Guibas, J. Saxe, and P.W. Shor A linear-time algorithm for computing the Voronoi diagram of a convex polygon Discrete Comput. Geom. 4 6 1989 591 604
3. D. Bandyopadhyay, J. Snoeyink, Almost-Delaunay simplices: Nearest neighbor relations for imprecise points, in: ACM-SIAM Symp. on Discrete Algorithms, 2004, pp. 403-412
4. D. Bandyopadhyay, and J. Snoeyink Almost-Delaunay simplices: Nearest neighbor relations for imprecise 3D points using CGAL Comput. Geom. 38 1-2 2007 4 15
5. K. Bühler, E. Dyllong, and W. Luther Reliable distance and intersection computation using finite precision geometry Numerical Software with Result Verification LNCS vol. 2991 2004 Springer Verlag 160 190
6. J. Cartigny, F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks Ad Hoc Networks 3 1 2005 1 16
7. CGAL Computational Geometry Algorithms Library http://www.cgal.org
8. B. Chazelle Triangulating a simple polygon in linear time Discrete Comput. Geom. 6 5 1991 485 524
9. F. Chin, J. Snoeyink, and C.A. Wang Finding the medial axis of a simple polygon in linear time Discrete Comput. Geom. 21 3 1999 405 420
10. F.Y.L. Chin, and C.A. Wang Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time SIAM J. Comput. 28 2 1998 471 486
11. H. Edelsbrunner, and E.P. Mücke Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms ACM Trans. Graph. 9 1 1990 66 104
12. J.S. Ely, and A.P. Leclerc Correct Delaunay triangulation in the presence of inexact inputs and arithmetic Reliable Computing 6 2000 23 38
13. S. Fortune Numerical stability of algorithms for 2-d Delaunay triangulations Internat. J. Comput. Geom. Appl. 5 1-2 1995 193 213
14. K.R. Gabriel, and R.R. Sokal A new statistical approach to geographic variation analysis Systematic Zoology 18 1969 259 278
15. M.T. Goodrich, J.S.B. Mitchell, M.W. Orletsky, Practical methods for approximate geometric pattern matching under rigid motion, in: Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994, pp. 103-112
16. R. Graham, B. Lubachevsky, K. Nurmela, and P. Östergård Dense packings of congruent circles in a circle Disc. Math. 181 1998 139 154
17. L.J. Guibas, D. Salesin, J. Stolfi, Epsilon geometry: building robust algorithms from imprecise computations, in: Proc. 5th Annu. ACM Sympos. Comput. Geom., 1989, pp. 208-217
18. L.J. Guibas, D. Salesin, and J. Stolfi Constructing strongly convex approximate hulls with inaccurate primitives Algorithmica 9 1993 534 560
19. M. Held, and J.S.B. Mitchell Triangulating input-constrained planar point sets Inf. Process. Lett. 109 1 2008 54 56
20. A.A. Khanban, Basic algorithms of computational geometry with imprecise input, PhD thesis, Imperial College, London, 2005
21. A.A. Khanban, A. Edalat, Computing Delaunay triangulation with imprecise input data, in: Proc. 15th Canad. Conf. Comput. Geom., 2003, pp. 94-97
22. A.A. Khanban, A. Edalat, and A. Lieutier Computability of partial Delaunay triangulation and Voronoi diagram V. Brattka, M. Schröder, K. Weihrauch, Electronic Notes in Theoretical Computer Science vol. 66 2002 Elsevier
23. M. Löffler, and M. van Kreveld Largest and smallest convex hulls for imprecise points Algorithmica 2008 10.1007/s00453-008-9174-2
24. K. Mehlhorn, and S. Näher LEDA: A Platform for Combinatorial and Geometric Computing 2000 Cambridge University Press Cambridge, UK
25. R. Seidel A method for proving lower bounds for certain geometric problems G.T. Toussaint, Computational Geometry 1985 North-Holland Amsterdam, Netherlands 319 334
26. J.R. Shewchuk Delaunay refinement algorithms for triangular mesh generation Comput. Geom. 22 1-3 2002 21 74
27. E. Specht The best known packings of equal circles in the unit circle (up to n = 500) http://hydra.nat.uni-magdeburg.de/packing/cci/cci.html July 2007
28. K. Sugihara, and M. Iri Two design principles of geometric algorithms in finite-precision arithmetic Appl. Math. Lett. 2 2 1989 203 206
29. K. Sugihara, and M. Iri Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic Proc. IEEE 80 9 1992 1471 1484
30. M. van Kreveld, M. Löffler, Largest bounding box, smallest diameter, and related problems on imprecise points, in: Proc. 10th Workshop on Algorithms and Data Structures, in: LNCS, vol. 4619, 2007, pp. 447-458
31. M. van Kreveld, M. Löffler, J.S.B. Mitchell, Preprocessing imprecise points and splitting triangulations, in: Proc. 19th International Symposium on Algorithms and Computation, 2008, pp. 544-555, http://dx.doi.org/10.1007/978-3- 540-92182-0-49
32. F. Weller, Stability of Voronoi neighborship under perturbations of the sites, in: Proc. 9th Canad. Conf. Comput. Geom., 1997, pp. 251-256
33. C. Yap Robust geometric computation J.E. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry second ed. 2004 CRC Press 927 952