Efficient computation of elliptic Gabriel graph
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Changhee | - |
dc.contributor.author | Kim, Donguk | - |
dc.contributor.author | Shin, Hayong | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2022-12-21T11:35:59Z | - |
dc.date.available | 2022-12-21T11:35:59Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2006-05 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181540 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Efficient computation of elliptic Gabriel graph | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1007/11751540_47 | - |
dc.identifier.scopusid | 2-s2.0-33745956670 | - |
dc.identifier.wosid | 000237642900047 | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, v.3980, pp.440 - 448 | - |
dc.relation.isPartOf | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1 | - |
dc.citation.title | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1 | - |
dc.citation.volume | 3980 | - |
dc.citation.startPage | 440 | - |
dc.citation.endPage | 448 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | Artificial intelligence | - |
dc.subject.keywordPlus | Computer science | - |
dc.subject.keywordPlus | Optimization | - |
dc.subject.keywordPlus | Triangulation | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/11751540_47 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.