Removing Degeneracies by Perturbing the Problem or Perturbing the World

Reliable Computing

Volumn 6, Issue 1, 2000, Pages 61-79

  Alliez, Pierre ^a   Devillers, Olivier ^b   Snoeyink, Jack ^c,d  

^a CCETT/DIH/ATI   (France)

^b INRIA   (France)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005508617     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009942427413     Document Type: Article

References (15)

1. De Floriani, L., Falcidieno, B., Nagy, G., and Pienovi, C.: On Sorting Triangles in a Delaunay Tessellation, Algorithmica 6 (1991), pp. 522-532.
2. Denny, M. and Sohler, Ch.: Encoding a Triangulation as a Permutation of Its Point Set, in: Canadian Conference on Computational Geometry, 1997, pp. 39-43.
3. Dillencourt, M. B. and Smith, W. D.: A Simple Method for Resolving Degeneracies in Delaunay Triangulation, in: Proc. 20th Internat. Colloq. Automata Lang. Program., volume 700 of Lecture Notes Comput. Sci., Springer-Verlag, 1993, pp. 177-188.
4. Drysdale, III, R. L.: A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions, in: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 159-168.
5. Edelsbrunner, H. and Mücke, E. P.: Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms, ACM Trans. Graph. 9 (1) (1990), pp. 66-104.
6. Emiris, I. Z. and Canny, J. F.: A General Approach to Removing Degeneracies, SIAM J. Comput. 24 (1995), pp. 650-664.
7. Emiris, I. Z., Canny, J. F., and Seidel, R.: Efficient Perturbations for Handling Geometric Degeneracies, Algorithmica 19 (1-2) (1997), pp. 219-242.
8. Kirkpatrick, D. and Snoeyink, J.: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation, Fundam. Inform. 21 (1995), pp. 353-370.
9. Klein, R.: Concrete and Abstract Voronoi Diagrams, volume 400 of Lecture Notes Comput. Sci., Springer-Verlag, 1989.
10. Klein, R., Mehlhorn, K., and Meiser, S.: Randomized Incremental Construction of Abstract Voronoi Diagrams, Comput. Geom. Theory Appl. 3 (3) (1993), pp. 157-184.
11. Mount, D. M. and Saalfeld, A.: Globally-Equiangular Triangulations of Co-Circular Points in O(n log n) Time, in: Proc. 4th Annu. ACM Sympos. Comput. Geom., 1988, pp. 143-152.
12. Neuhauser, M. A.: Symbolic Perturbations and Special Arithmetics for Controlled Handling of Geometric Degeneracies, in: Proc 5th WSCG'97, Plzen, Czech Republic, 1997, pp. 386-395.
13. Seidel, R.: The Nature and Meaning of Perturbations in Geometric Computing, in: Proc. 11th Sympos. Theoret. Aspects Comput. Sci., volume 775 of Lecture Notes Comput. Sci., Springer-Verlag, 1994, pp. 3-17.
14. Snoeyink, J. and van Kreveld, M.: Good Orders for Incremental (Re)constructions, in: Proc. 13th Anna. ACM Sympos. Comput. Geom., 1997, pp. 400-402.
15. Yap, C. K.: A Geometric Consistency Theorem for a Symbolic Perturbation Scheme, J. Comput. Syst. Sci. 40 (1) (1990), pp. 2-18.