9 June 1986 Adaptative Polyhedral Approximation Of Digitized Surfaces
Author Affiliations +
Proceedings Volume 0595, Computer Vision for Robots; (1986) https://doi.org/10.1117/12.952249
Event: 1985 International Technical Symposium/Europe, 1985, Cannes, France
Abstract
A method is proposed for the determination of a progressive polyhedral approximation of 3-D digitized surfaces whose points are located on a regular lattice. It relies on an iterative and adaptative splitting of the triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is operated. The algorithm allows for the measurement of the local quality of the approximation and avoids the generation of ill-defined triangles with sharp corners. Its low computational complexity permits the approximation of very large sets of points (hundreds of thousands).
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Schmitt Francis, Schmitt Francis, Gholizadeh Behrouz, Gholizadeh Behrouz, } "Adaptative Polyhedral Approximation Of Digitized Surfaces", Proc. SPIE 0595, Computer Vision for Robots, (9 June 1986); doi: 10.1117/12.952249; https://doi.org/10.1117/12.952249
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Generalization of Lloyd's algorithm for image segmentation
Proceedings of SPIE (February 01 1991)
Recognizing Partially Hidden Objects
Proceedings of SPIE (January 17 1985)
Recognition of 2-D shapes using set erosion
Proceedings of SPIE (February 01 1992)
Combined edge and region based method for range image...
Proceedings of SPIE (February 01 1991)
Segmenting text images with massively parallel machines
Proceedings of SPIE (February 01 1992)
Application of distance transform to range image segmentation
Proceedings of SPIE (February 01 1992)

Back to Top