Minimum Link Navigation

Please enable javascript in your browser.

Davari, Mohammad Javad | 2012

1589 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43975 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Zarei, Ali Reza
Abstract:
Finding a path between two specified points is one of the most common problem in computational geometry. The minimum-link path problem is in this category. The minimum-link path between two points is the path between these points with the minimum number of segments. Minimum-link paths have application in areas such as computer graphic, geographic information systems, robotics, image processing, cryptography and VLSI.In this thesis we study variations of the minimum link path problem. Specifically we consider the constrained minimum-link paths in which the path must passes through some given
regions. We detected a flaw in a previously presented algorithm and propose a method to fix this algorithm
Keywords:
Computational Geometry ; Line Simplification ; Minimum Link Path