# Constrained Delaunay triangulation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Computers & Graphics
- 2011

Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but areâ€¦Â (More)

Is this relevant?

2010

2010

- Proceedings ELMAR-
- 2010

Vectorization, i.e. raster-to-vector conversion, is a central part of graphics recognition problems. Graphics recognition isâ€¦Â (More)

Is this relevant?

2008

2008

- Journal Comp. Netw. and Communic.
- 2008

Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hocâ€¦Â (More)

Is this relevant?

2008

2008

- 7th World Congress on Intelligent Control andâ€¦
- 2008

This paper proposes a path planning algorithm for determining an optimal path with respect to the costs of a dual graph on theâ€¦Â (More)

Is this relevant?

2006

2006

- ISVC
- 2006

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presentedâ€¦Â (More)

Is this relevant?

2004

2004

- 2004

This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantageâ€¦Â (More)

Is this relevant?

2003

2003

- CCCG
- 2003

The problem of determining whether a polyhedron has a constr ai ed Delaunay tetrahedralization is NPcomplete. However, if no fiveâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- WACG
- 1996

Triangle is a C program for two-dimensional mesh generation and construction of Delaunay triangulations, constrained Delaunayâ€¦Â (More)

Is this relevant?

1994

1994

- The Visual Computer
- 1994

A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along theâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Symposium on Computational Geometry
- 1987

Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) isâ€¦Â (More)

Is this relevant?