Reduction of the search space in the edge-tracing algorithm for the Voronoi diagram of 3D balls
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Youngsong | - |
dc.contributor.author | Kim, Donguk | - |
dc.contributor.author | Lee, Hyun Chan | - |
dc.contributor.author | Park, Joon Young | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2022-12-21T11:36:04Z | - |
dc.date.available | 2022-12-21T11:36:04Z | - |
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/181541 | - |
dc.description.abstract | Voronoi diagram for 3D balls can be applicable to various fields in science and engineering. The edge-tracing algorithm constructs the Voronoi diagram in O(mn) time in the worst-case where m, and n are the numbers of edges and balls, respectively. The computation time of the algorithm is dominated by finding the end vertex of a given edge since all edges in the Voronoi diagram should be traced essentially. In this paper, we define the feasible region which a ball to define the end vertex of a given edge should intersect. Then, balls which do not intersect the feasible region are filtered out before finding an end vertex since they cannot define an end vertex. Therefore, we improve the runtime-performance of the edge-tracing algorithm via the feasible region. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Reduction of the search space in the edge-tracing algorithm for the Voronoi diagram of 3D balls | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1007/11751540_13 | - |
dc.identifier.scopusid | 2-s2.0-33745961209 | - |
dc.identifier.wosid | 000237642900013 | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, v.3980, pp.111 - 120 | - |
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 | 111 | - |
dc.citation.endPage | 120 | - |
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 | DENSITY | - |
dc.subject.keywordPlus | VOLUME | - |
dc.subject.keywordAuthor | Voronoi diagram for balls | - |
dc.subject.keywordAuthor | edge-tracing algorithm | - |
dc.subject.keywordAuthor | feasible region | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/11751540_13 | - |
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.