Computational geometry: an introduction
Computational geometry: an introduction
Theory of linear and integer programming
Theory of linear and integer programming
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Discrete analytical hyperplanes
Graphical Models and Image Processing
Geometric Constructions in the Digital Plane
Journal of Mathematical Imaging and Vision
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
An elementary digital plane recognition algorithm
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Discrete Applied Mathematics
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Gift-wrapping based preimage computation algorithm
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
An efficient and quasi linear worst-case time algorithm for digital plane recognition
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Discrete Representation of Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Recognition of blurred pieces of discrete planes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
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
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.01 |
Based on a classical convex hull algorithm called gift-wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage-roughly the set of naive digital planes containing a finite subset S of Z^3. The vertices of the upper hemisphere, the ones of the lower hemisphere and at last the equatorial vertices are computed independently. The principle of the algorithm is based on duality and especially on the fact that the vertices of the preimage correspond to faces of the input set S or of its chords set S@?S@?{(0,0,1)}. It allows to go from one vertex to another by gift-wrapping until the whole region of interest has been explored.