Computing Directional Constrained Delaunay Triangulations

@inproceedings{PlaComputingDC,
  title={Computing Directional Constrained Delaunay Triangulations},
  author={N{\'u}ria Pla}
}
  • Núria Pla
In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in [7] and [8] are presented. 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 given. 
10 Citations
10 References
Similar Papers

References

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

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

  • M. Vigo
  • Technical Report LSI-95- 43-R, Universitat Polite…
  • 1995
Highly Influential
3 Excerpts

Posenau . Approaches to high aspect ratio triangulations

  • K. M.
  • Pro - ceeds of 5 th canadian Conference on Comp…
  • 1993

Spatial Tessellations. Concepts and Applications of Voronoi Diagrams

  • A. Okabe, B. Boots, K. Sugihara
  • 1992
1 Excerpt

A survey of applications of an affine invariant norm

  • G. M. Nielson, T. A. Foley
  • Mathematical Methods in CAGD,
  • 1989
1 Excerpt

On optimal interpolation triangle incidences

  • E. F. D’Azzevedo, R. B. Simpson
  • SIAM J. Sci. Stat. Comput.,
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…