Skip to main content
Springer Nature Link
Log in

Fast algorithms for computing β-Skeletons and their relatives

  • Session 8A
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1997)

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

Included in the following conference series:

Abstract

In this paper we present fast algorithms for computing β-skeletons

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. L. Bentely and H. A. Maurer. A note on euclidean near neighbor searching in the plane. Inform. Process. Lett., 8:133–136, 1979.

    Google Scholar 

  2. M. Chang, C. Tang, and R. Lee. Solving the euclidean bottleneck matching problem by k-relative neighborhood graph. Algorithmica, 8:177–194, 1992.

    Google Scholar 

  3. J. W. Jaromczyk, M. Kowaluk, and F. Yao. An optimal algorithm for constructing β-skeletons in the l p metric. To be published in SIAM J. Computing.

    Google Scholar 

  4. D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217–248. North-Holland, 1985.

    Google Scholar 

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

    Google Scholar 

  6. Andy Mirzaian. Minimum weight euclidean matching and weighted relative neighborhood graphs. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 506–517, 1993.

    Google Scholar 

  7. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, New York, 1985.

    Google Scholar 

  8. S. V. Rao and Asish Mukhopadhyay. Output-sensitive algorithm for computing β-skeleton. manuscript, 1997.

    Google Scholar 

  9. T. H. Su and R. Ch. Chang. The k-gabriel graphs and their applications. In Proc. Int. Symp., SIGAL '90, pages 66–75, 1990.

    Google Scholar 

  10. T. H. Su and R. Ch. Chang. Computing the k-relative neighborhood graphs in euclidean plane. Pattern Recogn., 24:231–239, 1991.

    Google Scholar 

  11. G. T. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recogn., 12:261–268, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India

    S. V. Rao & Asish Mukhopadhyay

Authors
  1. S. V. Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asish Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hon Wai Leong Hiroshi Imai Sanjay Jain

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rao, S.V., Mukhopadhyay, A. (1997). Fast algorithms for computing β-Skeletons and their relatives. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-63890-3_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69662-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics