Efficient Computation of Elliptic Gabriel Graph

  • Changhee Lee
  • Donguk Kim
  • Hayong Shin
  • Deok-Soo Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3980)


Searching neighboring points around a point in a point set has been important for various applications and there have been extensive studies such as the minimum spanning tree, relative neighborhood graph, Delaunay triangulation, Gabriel graph, and so on.

Observing the fact that the previous approaches of neighbor search may possibly sample severely biased neighbors in a set of unevenly distributed points, an elliptic Gabriel graph has recently been proposed. By extending the influence region from a circle to an ellipse, the elliptic Gabriel graph generalizes the ordinary Gabriel graph. Hence, the skewness in the sampled neighbors is rather reduced.

In this paper, we present a simple observation which allows to compute the correct elliptic Gabriel graph efficiently by reducing the search space.


Extreme Point Minimum Span Tree Voronoi Diagram Delaunay Triangulation Asymptotic Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arya, S., Mount, D., Netanyahhu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM 45, 891–923 (1998)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry - Algorithms and Applications. Springer, Heidelberg (2000)MATHGoogle Scholar
  3. 3.
    Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proceedings of the IEEE 80, 1502–1517 (1992)CrossRefGoogle Scholar
  4. 4.
    Matula, D.W., Sokal, R.R.: Properties of Gabriel graphs relevant to geographic variation research and the clustering of point in the plane. Geographical Analysis 12(3), 205–222 (1980)CrossRefGoogle Scholar
  5. 5.
    Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley & Sons, Chichester (1999)Google Scholar
  6. 6.
    Park, J.C., Shin, H., Choi, K.: Elliptic gabriel graph for finding neighbors in a point set. In: Proceedings of the Society of CAD/CAM Engineers Conference (in printing) (2006)Google Scholar
  7. 7.
    Rogers, D.F., Adams, J.A.: Mathematical elements for computer graphics, 2nd edn. McGraw-Hill, New York (1989)Google Scholar
  8. 8.
    Urquhart, R.B.: Some properties of the planar Euclidean relative neighbourhood graph. Pattern Recognition Letters 1(5,6), 317–322 7 (1983)MATHCrossRefGoogle Scholar
  9. 9.
    Zwicker, M., Pauly, M., Knoll, O., Gross, M.: Pointshop 3d: An interactive system for point-based surface editing. In: Proceedings of the SIGGRAPH 2002 (2002)Google Scholar
  10. 10.
    Zwicker, M., Pfister, H., Baar, J., Gross, M.: Surface splatting. In: Proceedings of the SIGGRAPH 2001 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Changhee Lee
    • 1
  • Donguk Kim
    • 1
  • Hayong Shin
    • 2
  • Deok-Soo Kim
    • 1
  1. 1.Dept. of Industrial EngineeringHanyang UniversitySeoulKorea
  2. 2.Dept. of Industrial Engineering, KAISTDaejeonKorea

Personalised recommendations