A method for approximating range images by integrating triangular meshes and curvature information is presented. First, an adaptive filtering technique is applied to the original range image based on estimations of the surface curvature. This produces a collection of 3D points, which are triangulated in order to produce an initial mesh. The mesh is then refined through an efficient Delaunay triangulation algorithm. A new local error measure is used to select points to be inserted into the triangulation. Points tend to scatter in planar areas and to concentrate in high variation areas. The method allows representations to be retrieved at variables levels of accuracy, providing a natural way of multiresolution modeling. Some experimental results are presented to show that the proposed technique is effective to represent range images.
Modeling dense range images through fast polygonal approximations
2001-01-01
673547 byte
Conference paper
Electronic Resource
English
Modeling Dense Range Images through Fast Polygonal Approximations
British Library Conference Proceedings | 2001
|Optimized polygonal approximations through vertex relocations in contour neighborhoods
British Library Online Contents | 2015
|Matching and Fusing 3D-Polygonal Approximations for Model-Generation
British Library Conference Proceedings | 1994
|A Simulative Comparison of Ship Domains and Their Polygonal Approximations
DOAJ | 2015
|Computational modeling of polygonal cracks
Elsevier | 2024
|