Robust proximity queries: An illustration of degree-driven algorithm design

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 864-889

  Liotta, Giuseppe ^a   Preparata, Franco P ^b   Tamassia, Roberto ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b Brown Univerity   (United States)

Author keywords

Arithmetic precision; Geometric computing; Proximity queries; Robustness

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL GEOMETRY; DATABASE SYSTEMS; ERRORS; NUMERICAL METHODS; SET THEORY;

ARITHMETIC PRECISION; GEOMETRIC COMPUTING; PROXIMITY QUERIES;

ALGORITHMS;

EID: 0032257723     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796305365     Document Type: Article

References (59)

1. 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 (1989), pp. 591-604.
2. A. AGGARWAL, M. HANSEN, AND T. LEIGHTON, Solving query-retrieval problems by compacting Voronoi diagrams, in Proc. 22nd Annu. ACM Sympos. Theory Comput., 1990, Association for Computing Machinery, New York, pp. 331-340.
3. F. AURENHAMMER, Voronoi diagrams: A survey of a fundamental geometric data structure, ACM Comput. Surv., 23 (1991), pp. 345-405.
4. F. AVNAIM, J.-D. BOISSONNAT, O. DEVILLERS, F. PREPARATA, AND M. YVINEC, Evaluating Signs of Determinants Using Single-Precision Arithmetic, Research Report 2306, INRIA, BP93, 06902 Sophia-Antipolis, France, 1994.
5. J. E. BAKER, I. F. CRUZ, G. LIOTTA, AND R. TAMASSIA, The Mocha algorithm animation system, ACM Comput. Surv., 27 (1995), pp. 568-572.
6. J. E. BAKER, I. F. CRUZ, G. LIOTTA, AND R. TAMASSIA, Animating geometric algorithms over the Web, in Proc. 12th Annu. ACM Sympos. Comput. Geom., Association for Computing Machinery, New York, 1996, pp. C3-C4.
7. J. L. BENTLEY AND H. A. MAURER, A note on Euclidean near neighbor searching in the plane, Inform. Process. Lett., 8 (1979), pp. 133-136.
8. M. BOCHER, Introduction to Higher Algebra, Macmillan, New York, 1907.
9. C. BURNIKEL, Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universität des Saarlandes, Mar. 1996.
10. C. BURNIKEL, J. KÖNNEMANN, K. MEHLHORN, S. NÄHER, S. SCHIRRA, AND C. UHRIG, Exact geometric computation in LEDA, in Proc. 11th Annu. ACM Sympos. Comput. Geom., Association for Computing Machinery, New York, 1995, pp. C18-C19.
11. C. BURNIKEL, K. MEHLHORN, AND S. SCHIRRA, How to compute the Voronoi diagram of line segments: Theoretical and experimental results, in 2nd Annual European Symp. on Algorithms, Lecture Notes Comput. Sci. 855, Springer-Verlag, Berlin, 1994, pp. 227-239.
12. C. BURNIKEL, K. MEHLHORN, AND S. SCHIRRA, On degeneracy in geometric computations, in Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, pp. 16-23.
13. C. BURNIKEL, R. FLEISCHER, K. MEHLHORN, AND S. SCHIRRA, A strong and easily computable separation bound for arithmetic expressions involving square roots, in Proc. ACM-SIAM Symposium on Discrete Algorithms, 1997.
14. B. CHAZELLE, How to search in history, Inform. Control, 64 (1985), pp. 77-99.
15. B. CHAZELLE, R. COLE, F. P. PREPARATA, AND C. K. YAP, New upper bounds for neighbor searching, Inform. Control, 68 (1986), pp. 105-124.
16. B. CHAZELLE AND H. EDELSBRUNNER, An improved algorithm for constructing kth-order Voronoi diagrams, IEEE Trans. Comput., C-36 (1987), pp. 1349-1354.
17. B. CHAZELLE AND L. J. GUIBAS, Fractional cascading: I. A data structuring technique, Algorithmica, 1 (1986), pp. 133-162.
18. B. CHAZELLE AND L. J. GUIBAS, Fractional cascading: II. Applications, Algorithmica, 1 (1986), pp. 163-191.
19. K. L. CLARKSON, Safe and effective determinant evaluation, in Proc. 33rd Ann. IEEE Sympos. Found. Comput. Sci., IEEE Press, Piscataway, NJ, 1992, pp. 387-395.
20. T. K. DEY, K. SUGIHARA, AND C. L. BAJAJ, Delaunay triangulations in three dimensions with finite precision arithmetic, Comput. Aided Geom. Design, 9 (1992), pp. 457-470.
21. D. P. DOBKIN, Computational geometry and computer graphics, in Proc. IEEE, 80 (1992), pp. 1400-1411.
22. D. P. DOBKIN AND D. G. KIRKPATRICK, Fast detection of polyhedral intersection, Theoret. Comput. Sci., 27 (1982), pp. 241-253.
23. D. P. DOBKIN AND M. J. LASZLO, Primitives for the manipulation of three-dimensional subdivisions, Algorithmica, 4 (1989), pp. 3-32.
24. M. EDAHIRO, I. KOKUBO, AND T. ASANO, A new point-location algorithm and its practical efficiency: Comparison with existing algorithms, ACM Trans. Graph., 3 (1984), pp. 6-109.
25. H. EDELSBRUNNER, L. J. GUIBAS, AND J. STOLFI, Optimal point location in a monotone subdivision, SIAM J. Comput., 15 (1986), pp. 317-340.
26. H. EDELSBRUNNER AND H. A. MAURER, Finding extreme points in three dimensions and solving the post-office problem in the plane, Inform. Process. Lett., 21 (1985), pp. 39-47.
27. H. EDELSBRUNNER AND E. P. MÜCKE, Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms, ACM Trans. Graph., 9 (1990), pp. 66-104.
28. S. FORTUNE, Stable maintenance of point set triangulations in two dimensions, in Proc. 30th Ann. IEEE Sympos. Found. Comput. Sci., IEEE Press, Piscataway, NJ, 1989, pp. 494-505.
29. S. FORTUNE, Numerical stability of algorithms for 2-d Delaunay triangulations, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 193-213.
30. S. FORTUNE, Polyhedral modeling with multiprecision integer arithmetic, Comput. Aided Design, to appear.
31. S. FORTUNE AND C. J. VAN WYK, Efficient exact arithmetic for computational geometry, in Proc. 9th Annu. ACM Sympos. Comput. Geom., Association for Computing Machinery, New York, 1993, pp. 163-172.
32. S. FORTUNE AND C. V. WYK, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Trans. Graphics, 15 (1996), pp. 223-248.
33. S. J. FORTUNE, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), pp. 153-174.
34. D. H. GREENE AND F. F. YAO, Finite-resolution computational geometry, in Proc. 27th Ann. IEEE Sympos. Found. Comput. Sci., IEEE Press, Piscataway, NJ, 1986, pp. 143-152.
35. L. J. GUIBAS, D. E. KNUTH, AND M. SHARIR, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, 7 (1992), pp. 381-413.
36. L. J. GUIBAS, D. SALESIN, AND J. STOLFI, Epsilon geometry: Building robust algorithms from imprecise computations, in Proc. 5th Ann. ACM Sympos. Comput. Geom., Association for Computing Machinery, New York, 1989, pp. 208-217.
37. L. J. GUIBAS AND J. STOLFI, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graph., 4 (1985), pp. 74-123.
38. C. M. HOFFMANN, The problems of accuracy and robustness in geometric computation, IEEE Computer, 22 (1989), pp. 31-41.
39. C. M. HOFFMANN, J. E. HOPCROFT, AND M. T. KARASICK, Robust set operations on polyhedral solids, IEEE Comput. Graph. Appl., 9 (1989), pp. 50-59.
40. B. JOE, Construction of three-dimensional Delaunay triangulations using local transformations, Comput. Aided Geom. Design, 8 (1991), pp. 123-142.
41. M. KARASICK, D. LIEBER, AND L. R. NACKMAN, Efficient Delaunay triangulations using rational arithmetic, ACM Trans. Graph., 10 (1991), pp. 71-91.
42. D. G. KIRKPATRICK, Optimal search in planar subdivisions, SIAM J. Comput., 12 (1983), pp. 28-35.
43. D. T. LEE, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput., C-31 (1982), pp. 478-487.
44. D. T. LEE AND F. P. PREPARATA, Location of a point in a planar subdivision and its applications, SIAM J. Comput., 6 (1997), pp. 594-606.
45. G. LIOTTA, F. P. PREPARATA, AND R. TAMASSIA, Robust Proximity Queries in Implicit Voronoi Diagrams, Technical Report CS-96-16, Center for Geometric Computing, Comput. Sci. Dept., Brown Univ., Providence, RI, 1996.
46. K. MEHLHORN AND S. NÄHER, LEDA: A platform for combinatorial and geometric computing, Comm. ACM, 38 (1995), pp. 96-102.
47. K. MEHLHORN, S. NÄHER, T. SCHILZ, S. SCHIRRA, M. SEEL, R. SEIDEL, AND C. UHRIG, Checking geometric programs or verification of geometric structures, in Proc. 12th Ann. ACM Sympos. Comput. Geom., Association for Computing Machinery, New York, 1996, pp. 159-165.
48. V. J. MILENKOVIC, Verifiable implementations of geometric algorithms using finite precision arithmetic, Artif. Intell., 37 (1988), pp. 377-401.
49. E. MÜCKE, Detri 2.2: A robust implementation for 3d Triangulations, manuscript, http://www.geom.umn.edu:80/software/cglist/lowdvod.html (1996).
50. F. P. PREPARATA, A new approach to planar point location, SIAM J. Comput., 10 (1981), pp. 473-482.
51. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
52. F. P. PREPARATA AND R. TAMASSIA, Efficient point location in a convex spatial cell-complex, SIAM J. Comput., 21 (1992), pp. 267-280.
53. N. SARNAK AND R. E. TARJAN, Planar point location using persistent search trees, Comm. ACM, 29 (1986), pp. 669-679.
54. K. SUGIHARA AND M. IRI, Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic, Proc. IEEE, IEEE Press, Piscataway, NJ, 80 (1992), pp. 1471-1484.
55. K. SUGIHARA, Y. OOISHI, AND T. IMAI, Topology-oriented approach to robustness and its applications to several Voronoi-diagram algorithms, in Proc. 2nd Canad. Conf. Comput. Geom., 1990, pp. 36-39.
56. R. TAMASSIA AND J. S. VITTER, Optimal cooperative search in fractional cascaded data structures, Algorithmica, 15 (1996), pp. 154-171.
57. C. YAP AND T. DUBÉ, A Basis for Implementing Exact Geometric Algorithms, manuscript, http://simulation.nyu.edu/projects/exact/references.html (1993).
58. C. K. YAP, Symbolic treatment of geometric degeneracies, J. Symbolic Comput., 10 (1990), pp. 349-370.
59. C. K. YAP, Toward exact geometric computation, Comput. Geom., 7 (1997), pp. 3-23.