DocumentCode :
2074279
Title :
Polyhedral approximation and first order segmentation of unstructured point sets
Author :
Isselhard, Frank ; Brunnett, Guido ; Schreiber, Thomas
Author_Institution :
Dept. of Comput. Sci., Kaiserlautern Univ., Germany
fYear :
1998
fDate :
22-26 Jun 1998
Firstpage :
433
Lastpage :
441
Abstract :
The paper is concerned with the first two steps in a surface reconstruction process. Given a set of 3D points sampled from a physical model the first problem is that of creating a polyhedral approximation of the model. For that the authors introduce an algorithm which extends Boissonnat´s (1984) work. It allows the reconstruction of objects with arbitrary genus and proposes an automatic termination procedure. The next step in the process concerns the segmentation of the data points into regions for which each may be fitted by a single surface. They summarize some experiences with a region growing technique based on angle between normals criteria. Using just first order derivative estimations it is shown that the method is able to classify segments into predefined second order surface classes
Keywords :
computational geometry; image reconstruction; image segmentation; stereo image processing; 3D points; angle between normals criteria; arbitrary genus; automatic termination procedure; first order derivative estimations; first order segmentation; objects; physical model; polyhedral approximation; predefined second order surface classes; region growing technique; segment classification; surface reconstruction; unstructured point sets; Area measurement; Computational geometry; Computer graphics; Computer science; Computer vision; Data structures; Electrical capacitance tomography; Read only memory; Surface fitting; Surface reconstruction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Graphics International, 1998. Proceedings
Conference_Location :
Hannover
Print_ISBN :
0-8186-8445-3
Type :
conf
DOI :
10.1109/CGI.1998.694297
Filename :
694297
Link To Document :
بازگشت