Computing directional constrained Delaunay triangulations

@article{Anglada2000ComputingDC,
  title={Computing directional constrained Delaunay triangulations},
  author={Marc Vigo Anglada and N{\'u}ria Pla Garcia},
  journal={Computers & Graphics},
  year={2000},
  volume={24},
  pages={181-190}
}
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 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 presented, 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

An incremental algorithm based on edge swapping for constructing constrained Delaunay triangulations

M Vig, Vigo
An incremental algorithm based on edge swapping for constructing constrained Delaunay triangulations • 1995

Spatial Tessellatons. Concepts and Applications of Voronoi Diagrams

Obs A Okabe, B Boots, K Sugihara
Spatial Tessellatons. Concepts and Applications of Voronoi Diagrams • 1992

Adaptative mesh generation for viscous ows using Delaunay triangulation

D Mav, Mavriplis
Journal of Computational Physics • 1990

A survey of applications of an aane invariant norm

Nf, G M Nielson, T A Foley
Mathematical Methods in CAGD • 1989

Similar Papers

Loading similar papers…