Enumeration of shortest isothetic paths inside a digital object

DOI10.1007/978-3-319-19941-2_11MaRDI QIDQ5114615zbMATH OpenOpenAlexFDO

Authors Mousumi Dutt, Arindam Biswas, Bhargab B. Bhattacharya

Publication date 24 June 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

shape registrationisothetic polygonisothetic distancebounding rectanglevertical grid lines

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On finding shortest isothetic path inside a digital object
• On finding a shortest isothetic path and its monotonicity inside a digital object
• Finding Shortest Triangular Path in a Digital Object
• Finding shortest triangular path and its family inside a digital object
• On the number of shortest paths by neighborhood sequences on the square grid

Cited in

(5)

• On finding shortest isothetic path inside a digital object
• scientific article; zbMATH DE number 227225 (Why is no real title available?)
• Finding Shortest Triangular Path and its Family inside a Digital Object
• On finding a shortest isothetic path and its monotonicity inside a digital object
• Finding Shortest Triangular Path in a Digital Object

This page was built for publication: Enumeration of shortest isothetic paths inside a digital object

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114615)