A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Yong-Jin | - |
dc.contributor.author | Yu, Cheng-Chi | - |
dc.contributor.author | Yu, Min-Jing | - |
dc.contributor.author | Tang, Kai | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-07-30T04:58:40Z | - |
dc.date.available | 2021-07-30T04:58:40Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2016-12 | - |
dc.identifier.issn | 1077-2626 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/2494 | - |
dc.description.abstract | The medial axis is an important shape representation that finds a wide range of applications in shape analysis. For large-scale shapes of high resolution, a progressive medial axis representation that starts with the lowest resolution and gradually adds more details is desired. In this paper, we propose a fast and robust geometric algorithm that computes progressive medial axes of a large-scale planar shape. The key ingredient of our method is a novel structural analysis of merging medial axes of two planar shapes along a shared boundary. Our method is robust by separating the analysis of topological structure from numerical computation. Our method is also fast and we show that the time complexity of merging two medial axes is O(n log n(v)), where n is the number of total boundary generators, n(v) is strictly smaller than n and behaves as a small constant in all our experiments. Experiments on large-scale polygonal data and comparison with state-of-the-art methods show the efficiency and effectiveness of the proposed method. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1109/TVCG.2015.2511739 | - |
dc.identifier.scopusid | 2-s2.0-85027399275 | - |
dc.identifier.wosid | 000387360500003 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v.22, no.12, pp.2522 - 2536 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | - |
dc.citation.title | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | - |
dc.citation.volume | 22 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 2522 | - |
dc.citation.endPage | 2536 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
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, Software Engineering | - |
dc.subject.keywordPlus | VORONOI DIAGRAMS | - |
dc.subject.keywordPlus | AXIS TRANSFORM | - |
dc.subject.keywordPlus | DECOMPOSITION | - |
dc.subject.keywordPlus | COMPUTATION | - |
dc.subject.keywordPlus | SEGMENTS | - |
dc.subject.keywordPlus | CURVE | - |
dc.subject.keywordPlus | POINT | - |
dc.subject.keywordAuthor | Progressive medial axes | - |
dc.subject.keywordAuthor | shape hierarchy and evolution | - |
dc.subject.keywordAuthor | topology-oriented algorithm | - |
dc.subject.keywordAuthor | divide and conquer algorithm | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7364294/ | - |
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.