Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation

Cited 17 time in webofscience Cited 0 time in scopus
  • Hit : 398
  • Download : 0
Point-based shape representation has received increased attention in recent years, mainly due to its simplicity. One of the most fundamental operations for point set processing is to find the neighbors of each point. Mesh structures and neighborhood graphs are commonly used for this purpose. However, though meshes are very popular in the field of computer graphics, neighbor relations encoded in a mesh are often distorted. Likewise, neighborhood graphs, such as the minimum spanning tree (MST), relative neighborhood graph (RNG), and Gabriel graph (GG), are also imperfect as they usually give too few neighbors for a given point. In this paper, we introduce a generalization of Gabriel graph, named elliptic Gabriel graph (EGG), which takes an elliptic influence region instead of the circular region in GG. In order to determine the appropriate aspect ratio of the elliptic influence region of EGG, this paper also presents the analysis between the aspect ratio of the elliptic influence region and the average valence of the resulting neighborhood. Analytic and empirical test results are included. (c) 2006 Elsevier Ltd. All rights reserved.
Publisher
ELSEVIER SCI LTD
Issue Date
2006-06
Language
English
Article Type
Article
Citation

COMPUTER-AIDED DESIGN, v.38, pp.619 - 626

ISSN
0010-4485
DOI
10.1016/j.cad.2006.02.008
URI
http://hdl.handle.net/10203/88606
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 17 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0