A robust region approach to the computation of geometric graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 175-186

  D'Amore, Fabrizio ^a   Franciosa, Paolo G ^a   Liotta, Giuseppe ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC;

ASYMPTOTICALLY OPTIMAL; DOUBLE PRECISION; GEOMETRIC GRAPHS; MINIMUM SPANNING TREES; NEAREST NEIGHBORS; RELATIVE NEIGHBORHOOD GRAPHS; ROBUST ALGORITHM; SIDE EFFECT;

TREES (MATHEMATICS);

EID: 84896693109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_15     Document Type: Conference Paper

References (23)

1. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom., 6(5): 407-422, 1991.
2. J. D. Boissonnat and F. Preparata. Robust plane sweep for intersecting segments. Technical Report 3270, INRIA, Sophia Antipolis, 1997.
3. C. Burnikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universität des Saarlandes, Mar. 1996.
4. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 291-300, 1993.
5. D. Cheriton and R. E. Tarjan. Finding minimum spanning trees. SIAM J. Comput., 5: 724-742, 1976.
6. O. Devillers, G. Liotta, R. Tamassia, and F. P. Preparata. Cecking the convexity of polytopes and the planarity of subdivisions. In Algorithms and Data Structures (Proc. WADS 97), Volume 1272 of Lecture Notes Comput. Sci., pages 186-199. Springer-Verlag, 1997.
7. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th Annu. ACM Sympos. Theory Comput., pages 135-143, 1984.
8. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph., 4: 74-123, 1985.
9. K. Hinrichs, J. Nievergelt, and P. Schorn. An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. Acta Informatica, 29: 383-394, 1992.
10. M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulations using rational arithmetic. ACM Trans. Graph., 10: 71-91, 1991.
11. p metric. Computing, 40: 147-161, 1987.
12. D. Krznaric, C. Levcopoulos, and B. J. Nilsson. Minimum spanning trees in d dimensions. In Proc. of ESA 97, number 1284 in Lecture Notes in Computer Science, pages 341-349. Springer, 1997.
13. A. Lingas. A linear-time construction of the relative neighborhood graph from the Delaunay triangulation. Comput. Geom. Theory Appl., 4: 199-208, 1994.
14. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 156-165, 1997.
15. E. P. Mücke. Detri 2.2: A robust implementation for 3D triangulations. Manuscript, available at URL: http://www.geom.umn.edu:80/ software/cglist/lowdvod.html, 1996.
16. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
17. P. Schorn. Robust Algorithms in a Program Library for Geometric Computation, Volume 32 of Informatik-Dissertationen ETH Zürich. Verlag der Fachvereine, Zürich, 1991.
18. K. J. Supowit. The relative neighborhood graph with an application to minimum spanning trees. J. ACM, 30: 428-448, 1983.
19. P. M. Vaidya. Minimum spanning trees in k-dimensional space. SIAM J. Comput., 17: 572-582, 1988.
20. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4: 101-115, 1989.
21. Y. C. Wee, S. Chaiken, and D. E. Willard. General metrics and angle restricted voronoi diagrams. Technical Report 88-31, Comp. Sci. Dpt., Univ. at Albany, November 1988.
22. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11: 721-736, 1982.
23. C. K. Yap. Robust geometric computation. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 35, pages 653-668. CRC Press LLC, Boca Raton, FL, 1997.