Single source shortest paths in simple polygons
A classic problem Computational Geometry is finding all euclidean shortest paths in a simple polygon from a given source vertex to every other vertex in the boundary. In this text, we give a detailed description of the Visibility Graph and Shortest Path Tree structures that solve this problem and al...
| Autor: | |
|---|---|
| Formato: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | Brasil |
| Recursos: | Universidade de São Paulo (USP) |
| Repositorio: | Biblioteca Digital de Teses e Dissertações da USP |
| Idioma: | inglés |
| OAI Identifier: | oai:teses.usp.br:tde-22082019-134801 |
| Acesso em linha: | http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22082019-134801/ |
| Access Level: | acceso abierto |
| Palavra-chave: | Algorithms Algoritmos Caminhos mínimos Computational geometry Geometria computacional Polígonos simples Shortest paths Simple polygons |
| Resumo: | A classic problem Computational Geometry is finding all euclidean shortest paths in a simple polygon from a given source vertex to every other vertex in the boundary. In this text, we give a detailed description of the Visibility Graph and Shortest Path Tree structures that solve this problem and also present the Shortest Path Map structure that extends the solution to shortest paths to every point inside the polygon. |
|---|