Résumé: In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in Vigo (Technical Report LSI-95-UR-R, Universitat PoliteHcnica de Catalunya, 1995; Computer &Graphics 1997;21(2):215}23) are presented. While the "rst 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 given.

Langue: Anglais