Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Length estimators for digitized contours
Computer Vision, Graphics, and Image Processing
Design of Perimeter Estimators for Digitized Planar Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Length Estimation in 3-D Using Cube Quantization
Journal of Mathematical Imaging and Vision
3D scan-conversion algorithms for voxel-based graphics
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
3D Line Voxelization and Connectivity Control
IEEE Computer Graphics and Applications
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometrical parameters extraction from discrete paths
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Approximation of 3D shortest polygons in simple cube curves
Digital and image geometry
| Hi-index | 0.00 |
We propose in this paper an arithmetical definition of 3-D discrete lines as well as an efficient construction algorithm. From this notion, an algorithm of 3-D discrete lines segmentation has been developed. It is then used to calculate the length of a discrete curve. A proof of the multigrid convergence of length estimators is presented.