Advertisement

A linear-time construction of the relative neighborhood graph within a histogram

  • Andrzej Lingas
  • Asish Mukhopadhyay
Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 955)

Abstract

A linear-time algorithm for constructing the constrained relative neighborhood graph or the constrained Gabriel graph of a histogram is presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Aggarwal, L.J. Guibas, J. Saxe, and P.W. Shor, A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discrete and Computational Geometry 4, 1987.Google Scholar
  2. [2]
    P.K. Agarwal and J. Matousek, Relative Neighborhood Graphs in Three Dimensions, Computational Geometry: Theory and Applications 2(1), pp. 1–14 (1992).CrossRefGoogle Scholar
  3. [3]
    F. Aurenhammer, Voronoi Diagrams — A Survey of a Fundamental Geometric Data Structure, ACM Computing Surveys, Vol. 23, No. 3, September 1991, pp.345–406.CrossRefGoogle Scholar
  4. [4]
    L. P. Chew, Constrained Delaunay Triangulations, Algorithmica 4 (1989), pp. 97–108.CrossRefGoogle Scholar
  5. [5]
    A. Fournier and D. Y. Montuno, Triangulating Simple Polygons and Equivalent Problems, ACM Transactions on Graphics 3(2), pp. 153–174, 1984.CrossRefGoogle Scholar
  6. [6]
    K. R. Gabriel and R. R. Sokal, A New Statistical Approach to Geographic Variation Analysis, Systematic Zoology 18 (1969), pp. 259–278.Google Scholar
  7. [7]
    M.R. Garey, D.S. Johnson, F.P. Preparata and R.E. Tarjan, Triangulating a simple polygon, IPL 7(4), pp. 175–179, 1978.Google Scholar
  8. [8]
    E. Jennings and A. Lingas, Relationships between Constrained Geometric Structures, Proc. ISAAC'92, Nagoya, LNCS 650, pp. 165–176, Springer Verlag.Google Scholar
  9. [9]
    J.W. Jaromczyk and M. Kowaluk, A note on relative neighborhood graphs, Proc. 3rd ACM Symp. on Computational Geometry, pp. 233–241 (1987).Google Scholar
  10. [10]
    J.W. Jaromczyk and M. Kowaluk and F.F. Yao, An Optimal Algorithm for Constructing β-skeletons in Lp metric, to appear in SIAM J. Computing.Google Scholar
  11. [11]
    J. W. Jaromczyk and G. T. Toussaint, Relative Neighborhood Graphs and Their Relatives, Proceedings of the IEEE 80(9), pp.1502–1516 (1992).CrossRefGoogle Scholar
  12. [12]
    R. Klein and A. Lingas, Manhattonian Proximity in a Simple Polygon, Proc. 8th ACM Symposium on Computational Geometry, Berlin, 1992, pp. 312–319. To appear in Int. J. Comput. Geom. & Applications.Google Scholar
  13. [13]
    R. Klein and A. Lingas, A Linear-time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon, Proc. ACM Symposium on Computational Geometry, San Diego, 1993.Google Scholar
  14. [14]
    R. Klein and A. Lingas, Fast Skeleton Construction, manuscript 1994.Google Scholar
  15. [15]
    D.G. Kirkpatrick and J.D. Radke, A Framework for Computational Morphology, in Computational Geometry, edited by G. Toussaint, pp. 217–248, North-Holland, 1985.Google Scholar
  16. [16]
    A. Lingas, A linear-time construction of the relative neighborhood graph from the Delaunay triangulation, Computational Geometry: Theory and Applications 4, pp. 199–208 (1994).Google Scholar
  17. [17]
    D. T. Lee and A. K. Lin, Generalized Delaunay Triangulation for Planar Graphs, Discrete and Computational Geometry, 1 (1986), pp. 201–217.Google Scholar
  18. [18]
    D.T. Lee and B. Schachter, Two algorithms for constructing Delaunay triangulations, Int. J. Comput. and Info. Sci. 9(3), pp. 219–242 (1980).CrossRefGoogle Scholar
  19. [19]
    D.W. Matula and R.R. Sokal, Properties of Gabriel graphs relevant to geographic variation search and the clustering of points in the plane, Geogr. Analysis 12, pp. 205–222 (1980).Google Scholar
  20. [20]
    F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Texts and Monographs in Theoretical Computer Science, Springer Verlag, New York, 1985.Google Scholar
  21. [21]
    G.T. Toussaint, The relative neighbourhood graph of a finite planar set, Pattern Recognition 12, pp. 261–268 (1980).CrossRefGoogle Scholar
  22. [22]
    R. Seidel, Constrained Delaunay Triangulations and Voronoi Diagrams with Obstacles, In Rep. 260, IIG-TU, Graz, Australia, 1988, pp. 178–191.Google Scholar
  23. [23]
    T.H. Su and R.C. Chang, Computing the constrained relative neighborhood graphs and constrained Gabriel graphs in Euclidean plane, Pattern Recognition 24, pp. 221–230 (1991).CrossRefGoogle Scholar
  24. [24]
    K.J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, J. Assoc. Comput. Mach. 30, pp. 428–448 (1983).Google Scholar
  25. [25]
    C. A. Wang and L. Schubert, An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments, Proc. 3rd Annual Symposium on Computational Geometry, June 8–10, 1987, Waterloo, Ontario, Canada, pp. 223–232.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Andrzej Lingas
    • 1
  • Asish Mukhopadhyay
    • 2
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.Computer Science and EngineeringIndian Institute of TechnologyKanpurIndia

Personalised recommendations