224 0

A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes

Title
A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes
Author
김덕수
Keywords
Progressive medial axes; shape hierarchy and evolution; topology-oriented algorithm; divide and conquer algorithm
Issue Date
2015-12
Publisher
IEEE COMPUTER SOC
Citation
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v. 22, NO 12, Page. 2522-2536
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 nv), where n is the number of total boundary generators, nv 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.
URI
http://ieeexplore.ieee.org/document/7364294/http://hdl.handle.net/20.500.11754/29459
ISSN
1077-2626; 1941-0506
DOI
10.1109/TVCG.2015.2511739
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > MECHANICAL ENGINEERING(기계공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE