Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Digital Planar Segment Based Polyhedrization for Surface Area Estimation
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Polyhedrization of the Boundary of a Voxel Object
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Recognition of Digital Naive Planes and Polyhedrization
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Discrete linear objects in dimension n: the standard model
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
VIS '94 Proceedings of the conference on Visualization '94
VIS '04 Proceedings of the conference on Visualization '04
An elementary digital plane recognition algorithm
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A generalized preimage for the standard and supercover digital hyperplane recognition
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Reversible polygonalization of a 3d planar discrete curve: application on discrete surfaces
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
3D noisy discrete objects: Segmentation and application to smoothing
Pattern Recognition
Segmentation of noisy discrete surfaces
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
| Hi-index | 0.00 |
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve from a planar digital curve, that is a curve which belongs to a digital plane. Based on this algorithm, we propose a new method for converting the boundary of digital volumetric objects into polygonal meshes which aims at providing a topologically consistent and invertible reconstruction, i.e. the digitization of the obtained object is equal to the original digital data. Indeed, we do not want any information to be added or lost. In order to limit the number of generated polygonal faces, our approach is based on the use of digital geometry tools which allow the reconstruction of large pieces of planes.