A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes
- Authors
- Liu, Yong-Jin; Yu, Cheng-Chi; Yu, Min-Jing; Tang, Kai; Kim, Deok-Soo
- Issue Date
- Dec-2016
- Publisher
- IEEE COMPUTER SOC
- Keywords
- Progressive medial axes; shape hierarchy and evolution; topology-oriented algorithm; divide and conquer algorithm
- Citation
- IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v.22, no.12, pp.2522 - 2536
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
- Volume
- 22
- Number
- 12
- Start Page
- 2522
- End Page
- 2536
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/2494
- DOI
- 10.1109/TVCG.2015.2511739
- ISSN
- 1077-2626
- 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.
- 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.