Skip to main content
SpringerLink
Log in

A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)

  • Conference paper
  • First Online:
Algorithms — ESA’ 98 (ESA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1461))

Included in the following conference series:

Abstract

We present robust algorithms for computing the minimum spanning tree, the nearest neighbor graph and the relative neighborhood graph of a set of points in the plane, under the L 2 metric. Our algorithms are asymptotically optimal, and use only double precision arithmetic. As a side effect of our results, we solve a question left open by Katajainen [11] about the computation of relative neighborhood graphs.

Research partially supported by the EC ESPRIT Long Term Research Project ALCOM-IT under contract 20244.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. D. Boissonnat and F. Preparata. Robust plane sweep for intersecting segments. Technical Report 3270, INRIA, Sophia Antipolis, 1997.

    Google Scholar 

  3. C. Burnikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universität des Saarlandes, Mar. 1996.

    Google Scholar 

  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.

    Google Scholar 

  5. D. Cheriton and R. E. Tarjan. Finding minimum spanning trees. SIAM J. Comput., 5:724–742, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Karasick, D. Lieber, and L. R. Nackman. Effcient Delaunay triangulations using rational arithmetic. ACM Trans. Graph., 10:71–91, 1991.

    Article  Google Scholar 

  11. J. Katajainen. The region approach for computing relative neighborhood graphs in the L p metric. Computing, 40:147–161, 1987.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  13. A. Lingas. A linear-time construction of the relative neighborhood graph from the Delaunay triangulation. Comput. Geom. Theory Appl., 4:199–208, 1994.

    MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  16. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.

    Google Scholar 

  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.

    MATH  Google Scholar 

  18. K. J. Supowit. The relative neighborhood graph with an application to minimum spanning trees. J. ACM, 30:428–448, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  19. P. M. Vaidya. Minimum spanning trees in k-dimensional space. SIAM J. Comput., 17:572–582, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  20. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101–115, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  22. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11:721–736, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198, Roma, Italy

    Fabrizio d’Amore, Paolo G. Franciosa & Giuseppe Liotta

Authors
  1. Fabrizio d’Amore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo G. Franciosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giuseppe Liotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

d’Amore, F., Franciosa, P.G., Liotta, G. (1998). A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation