Computing directional constrained Delaunay triangulations

Consultar RECERCAT

Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/84373

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Vigo Anglada, Marc
dc.date	1998-03
dc.identifier.citation	Vigo, M. "Computing directional constrained Delaunay triangulations". 1998.
dc.identifier.uri	http://hdl.handle.net/2117/84373
dc.language.iso	eng
dc.relation	LSI-98-29-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Infografia
dc.subject	Constrained Delaunay triangulations
dc.subject	Elliptical distances
dc.title	Computing directional constrained Delaunay triangulations
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	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.

Vigo Anglada, Marc; Pla García, Núria; Ayala Vallespí, M. Dolors; Martínez Bayona, Jonás

Martínez Bayona, Jonás; Pla García, Núria; Vigo Anglada, Marc

Vigo Anglada, Marc; Pla García, Núria; Brunet Crosa, Pere

Vigo Anglada, Marc

Ayala Vallespí, M. Dolors; Pla García, Núria; Soto Riera, Antoni; Vigo Anglada, Marc; Vila Marta, Sebastià

Coordinació

Patrocini