ETDs @PUC-Rio
| Título: | AN ALGORITHM FOR THE COMPUTATION OF SOME DISTANCE FUNCTIONS BETWEEN CONVEX POLYGONS | ||||||||||||
| Autor: |
SERGIO LIFSCHITZ |
||||||||||||
| Colaborador(es): |
CELSO DA CRUZ CARNEIRO RIBEIRO - Orientador |
||||||||||||
| Catalogação: | 28/DEZ/2006 | Língua(s): | PORTUGUESE - BRAZIL |
||||||||||
| Tipo: | TEXT | Subtipo: | THESIS | ||||||||||
| Notas: |
[pt] Todos os dados constantes dos documentos são de inteira responsabilidade de seus autores. Os dados utilizados nas descrições dos documentos estão em conformidade com os sistemas da administração da PUC-Rio. [en] All data contained in the documents are the sole responsibility of the authors. The data used in the descriptions of the documents are in conformity with the systems of the administration of PUC-Rio. |
||||||||||||
| Referência(s): |
[pt] https://www.maxwell.vrac.puc-rio.br/projetosEspeciais/ETDs/consultas/conteudo.php?strSecao=resultado&nrSeq=9412&idi=1 [en] https://www.maxwell.vrac.puc-rio.br/projetosEspeciais/ETDs/consultas/conteudo.php?strSecao=resultado&nrSeq=9412&idi=2 |
||||||||||||
| DOI: | https://doi.org/10.17771/PUCRio.acad.9412 | ||||||||||||
| Resumo: | |||||||||||||
|
We present in this dissertation a new algorithm for the
computation of some distance functions between convex
polygons, in the general case where they can intersect,
whose worst case time complexity is better than of the
previously known algorithms. The algorthm is based on an
algorithm originally proposed for the computation of the
Hausdorff distance between disjoint polygons and uses as
its main component a linear time algorithm for finding the
intersection of convex polygons. The motivation for the
study of efficient algorithms for this distance computation
problem comes from applications in pattern recognition and
contour fitting. Computatioal results are also presented.
|
|||||||||||||
|
|||||||||||||