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.
CitationVigo, M. "Computing directional constrained Delaunay triangulations". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com