Efficient computation of elliptic gabriel graph

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 153
  • Download : 0
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. © Springer-Verlag Berlin Heidelberg 2006.
Springer Verlag
Issue Date

ICCSA 2006: International Conference on Computational Science and Its Applications, pp.440 - 448

Appears in Collection
IE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0