A slow algorithm for computing the gabriel graph with double precision

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Volumn , Issue , 2011, Pages

  Millman, David L ^a   Verma, Vishal ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOUBLE PRECISION; FINITE SET; GABRIEL GRAPH; SPACE USAGE;

ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 84882953666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag New York, Inc., 3rd edition, 2008.
2. K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):pp. 259-278, 1969.
3. G. Liotta. Low degree algorithms for computing and checking gabriel graphs. Technical report, Providence, RI, USA, 1996.
4. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: An illustration of degree-driven algorithm design. SIAM J. Comput., 28(3):864-889, 1999.
5. A. Mantler and J. Snoeyink. Intersecting red and blue line segments in optimal time and precision. In Discrete and Computational Geometry, number 2098 in LNCS, pages 244-251. Springer Verlag, 2001.
6. D. W. Matula and R. R. Sokal. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane. Geographical Analysis, 12(3):205-222, 1980.