Efficient Computation of Elliptic Gabriel Graph
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.
KeywordsExtreme Point Minimum Span Tree Voronoi Diagram Delaunay Triangulation Asymptotic Line
Unable to display preview. Download preview PDF.
- 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.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.Rogers, D.F., Adams, J.A.: Mathematical elements for computer graphics, 2nd edn. McGraw-Hill, New York (1989)Google Scholar
- 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.Zwicker, M., Pfister, H., Baar, J., Gross, M.: Surface splatting. In: Proceedings of the SIGGRAPH 2001 (2001)Google Scholar