Finding Shortest Triangular Path in a Digital Object
From MaRDI portal
Publication:5739397
Recommendations
- Finding shortest triangular path and its family inside a digital object
- Finding Shortest Triangular Path and its Family inside a Digital Object
- On finding shortest isothetic path inside a digital object
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Searching shortest paths on a set of geometric objects
- Enumeration of shortest isothetic paths inside a digital object
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Finding Shortest Paths With Computational Geometry
- On finding a shortest isothetic path and its monotonicity inside a digital object
- scientific article; zbMATH DE number 727953
Cited in
(7)- Enumeration of shortest isothetic paths inside a digital object
- On finding shortest isothetic path inside a digital object
- Triangular covers of a digital object
- Finding Shortest Triangular Path and its Family inside a Digital Object
- Finding shortest triangular path and its family inside a digital object
- On finding a shortest isothetic path and its monotonicity inside a digital object
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
This page was built for publication: Finding Shortest Triangular Path in a Digital Object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739397)