Skip to search formSkip to main contentSkip to account menu

Constrained Delaunay triangulation

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
  • V. DomiterB. Žalik
  • International Journal of Geographical Information…
  • 2008
  • Corpus ID: 45050677
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining… 
2004
2004
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage… 
Highly Cited
2000
Highly Cited
2000
I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a… 
1999
1999
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In… 
1997
1997
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line… 
Highly Cited
1996
Highly Cited
1996
  • J. Shewchuk
  • Workshop on Applied Computational Geometry
  • 1996
  • Corpus ID: 14356403
Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement… 
1993
1993
TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the… 
Highly Cited
1989
Highly Cited
1989
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay… 
Highly Cited
1989
Highly Cited
1989
  • T. Baker
  • Engineering computations
  • 1989
  • Corpus ID: 41810825
This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation, can treat… 
Highly Cited
1987
Highly Cited
1987
  • L. Chew
  • SCG '87
  • 1987
  • Corpus ID: 6317590
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is…