Finding Shortest Triangular Path in a Digital Object

DOI10.1007/978-3-319-32360-2_16zbMATH Open1394.68421OpenAlexW2468859120MaRDI QIDQ5739397FDOQ5739397

Authors: Apurba Sarkar, Arindam Biswas, Shouvick Mondal, Mousumi Dutt 

Publication date: 15 July 2016

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32360-2_16

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

zbMATH Keywords

shape analysisshortest pathdigital geometrymonotone pathshape complexityshortest triangular path

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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)