ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Segmentation and Length Estimation of 3D Discrete Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Multigrid Convergence of Geometric Features
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Length Estimation for Curves with Different Samplings
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
An approximation algorithm for computing minimum-length polygons in 3D images
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Toward polygonalisation of thick discrete arcs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Shortest paths in a cuboidal world
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Asymptotics for Length and Trajectory from Cumulative Chord Piecewise-Quartics
Fundamenta Informaticae
| Hi-index | 0.01 |
Simple cube-curves in a 3D orthogonal grid are polyhedrally bounded sets which model digitized curves or arcs in three-dimensional euclidean space. The length of such a simple digital curve is defined to be the length of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve. A critical edge is a grid edge contained in three consecutive cubes of a simple cube-curve. This paper shows that critical edges are the only possible locations of vertices of the minimum-length polygonal curve fully contained and complete in the tube of this digital curve.