Efficient computation of elliptic Gabriel graph
- Authors
- Lee, Changhee; Kim, Donguk; Shin, Hayong; Kim, Deok-Soo
- Issue Date
- May-2006
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, v.3980, pp.440 - 448
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1
- Volume
- 3980
- Start Page
- 440
- End Page
- 448
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181540
- DOI
- 10.1007/11751540_47
- ISSN
- 0302-9743
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.