Models and algorithms for efficient multiresolution topology estimation of measured 3-D range data
- Authors
- Park, IK; Lee, KM; Lee, SU
- Issue Date
- Aug-2003
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- -3-D range data; dynamic mesh; K-means clustering; multiresolution; polygonal mesh; topology estimation
- Citation
- IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, v.33, no.4, pp.706 - 711
- Journal Title
- IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- Volume
- 33
- Number
- 4
- Start Page
- 706
- End Page
- 711
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25950
- DOI
- 10.1109/TSMCB.2003.814301
- ISSN
- 1083-4419
- Abstract
- In this paper, we propose a new efficient topology estimation algorithm to construct a multiresolution polygonal mesh from measured three-dimensional (3-D) range data. The topology estimation problem is defined under the constraints of cognition, compactness, and regularity, and the algorithm is designed to be applied to either a cloud of points or a dense mesh. The proposed algorithm initially segments the range data into a finite number of Voronoi patches using the K-means clustering algorithm. Each patch is then approximated by an appropriate polygonal and eventually a triangular mesh model. In order to improve the equiangularity of the mesh, we employ a dynamic mesh model, in which the mesh finds its equilibrium state adaptively, according to the equiangularity constraint. Experimental results demonstrate that satisfactory equiangular triangular mesh models can be constructed rapidly at various resolutions, while yielding tolerable modeling error.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electronic & Electrical Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25950)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.