Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Recognition of Digital Naive Planes and Polyhedrization
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Discrete linear objects in dimension n: the standard model
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Discrete analytical curve reconstruction without patches
Image and Vision Computing
Discrete Representation of Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
A generalized preimage for the digital analytical hyperplane recognition
Discrete Applied Mathematics
Discrete Applied Mathematics
Duality and geometry straightness, characterization and envelope
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Two discrete-euclidean operations based on the scaling transform
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
| Hi-index | 0.00 |
A new efficient standard discrete line recognition method is presented. This algorithm incrementally computes in linear time all straight lines which cross a given set of pixels. Moreover, pixels can be considered in any order and do not need to be connected. A new invertible 2D discrete curve reconstruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digitization is equal to the discrete curve. These two methods are based on the definition of a new generalized preimage and the framework is the discrete analytical geometry.