Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10361450 | Pattern Recognition Letters | 2012 | 9 Pages |
Abstract
⺠We show that previous sampling conditions of the refinement reduction algorithm are insufficient. ⺠We define new locally adaptive sampling conditions based on a new pruned medial axis. ⺠The new sampling conditions guaranty the pruned medial axis components to be correctly separated. ⺠Based on our results we propose a new criterion for locally adaptive point set decimation. ⺠We discuss why our sampling conditions lead to a refinement instead of a correct reconstruction itself.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Leonid Tcherniavski, Christian Bähnisch, Hans Meine, Peer Stelldinger,