Estimating shortest paths and minimal distances on digitized three-dimensional surfaces

Pattern Recognition

Volumn 26, Issue 11, 1993, Pages 1623-1637

  Kiryati, Nahum ^a   Székely, Gabor ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

3D shape analysis; Chain codes; Distance transformation; Geodesic paths; Perimeter estimation; Shortest paths

Indexed keywords

CHAIN CODES; DIGITIZED THREE DIMENSIONAL SURFACES; GEODESIC PATH; PERIMETER ESTIMATION; SHORTEST PATH;

DISTANCE MEASUREMENT; GEOMETRY; THREE DIMENSIONAL; THREE DIMENSIONAL COMPUTER GRAPHICS;

PATTERN RECOGNITION;

EID: 0027695496     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(93)90018-R     Document Type: Article

References (18)

1. A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces
2. Surface analysis methods
3. The discrete geodesic problem
4. Computing minimal distances on polyhedral surfaces
5. Design of perimeter estimators for digitized planar shapes
6. Computer processing of line drawing images
7. On chain code probabilities and length estimators for digitized three dimensional curves
8. Local distances for distance transformations in two and three dimensions
9. Display of 3D information in discrete 3D scenes produced by computerized tomography
10. On the quantization of line drawing-data
11. An efficient uniform cost algorithm applied to distance transforms
12. Estimation of length for digitized straight lines in three dimensions
13. Estimation of the original length of a straight line segment from its digitization in three dimensions
14. Optimization of length measurements for isotropic distance transformations in three dimensions
15. Computing distance transformations in convex and non-convex domains