Computing directional constrained Delaunay triangulations
This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated t...
| Autor: | |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84373 |
| Acesso em linha: | https://hdl.handle.net/2117/84373 |
| Access Level: | acceso abierto |
| Palavra-chave: | Constrained Delaunay triangulations Elliptical distances Àrees temàtiques de la UPC::Informàtica::Infografia |
| Resumo: | This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are presented. |
|---|