Name
Abstract | ||
|---|---|---|
This 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 we introduce an algorithm which extends Boissonnat's 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. Here we 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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/CGI.1998.694297 | Computer Graphics International |
Keywords | Field | DocType |
first order segmentation,unstructured point sets,polyhedral approximation,computer graphics,region growing,computational geometry,physical model,image reconstruction,second order,computer science,data structures,objects,first order,image segmentation,computer vision,read only memory,surface reconstruction | Data point,Iterative reconstruction,Surface reconstruction,Computer vision,Mathematical optimization,Segmentation,First order,Computer science,Computational geometry,Image segmentation,Artificial intelligence,Region growing | Conference |
ISBN | Citations | PageRank |
0-8186-8445-3 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. Isselhard | 1 | 0 | 0.34 |
| G. Brunnett | 2 | 39 | 4.44 |
| T. Schreiber | 3 | 0 | 0.34 |