Finding Shortest Triangular Path in a Digital Object

DOI10.1007/978-3-319-32360-2_16zbMath1394.68421OpenAlexW2468859120MaRDI QIDQ5739397

Mousumi Dutt, Shouvick Mondal, Apurba Sarkar, Arindam Biswas

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

zbMATH Keywords

shortest pathshape analysisdigital geometrymonotone pathshape complexityshortest triangular path

Mathematics Subject Classification ID

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

This page was built for publication: Finding Shortest Triangular Path in a Digital Object