Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
On the Complexity of Finding a Minimum Cycle Cover of a Graph
SIAM Journal on Computing
Digital Planarity of Rectangular Surface Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Concurrency of Line Segments in Uncertain Geometry
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Recognition of digital hyperplanes and level layers with forbidden points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.01 |
Many applications, manipulation or just visualization of discrete volumes are time consuming problems. The general idea to solve these difficulties is to transform, in a reversible way, those volumes into Euclidean polyhedra. A first step of this process consists in a Digital Plane Segmentation of the discrete object's surface. In this paper, we present an algorithm to construct an optimal, in the number of vertices, discrete volume polyhedral representation (i.e. vertices and faces adjacencies).