E

A
N
I
M
E
S
R

Boris
N.Delaunay

E
G
E
L
L
O
C
H
T
A
N
A
DR
N
R
U
S
U
R
U
G
A
R
T
S
RA

Y
A
N
U
A
L
DE
N
O
I
T
A
L
U
PG SEM3
G
N
PAPERTRIA
CMSM P3.5

CMSM P3.5

E
M
O
C
L
E

Presented BY
ADRITA
CHAKRABORTY

CONTENTS
MOTIVATION: TERRAIN
TRIANGULATION
Property of triangulation
SOLUTION OF TERRAIN PROBLEME
ANGLE OPTIMAL TRIANGULATION
EDGE FLIPPING
THALES THEOREM
ILLEGAL TRIANGULATION
LEGAL TIANGULATION
DELAUNAY GRAPH
DELAUNAY TRIANGULATION
Property of Delaunay Triangulation
Computing Delaunay Triangulation
RANDOMIZED INCREMENTAL
CONSTRUCTION
Application of Delaunay Triangulation
Euclidean Minimum Spanning Tree
Clustering
REFERENCES
Delaunay Triangulation

5/9/2016

MOTIVATION :
TERRAINS
We can model
a piece of the earths surface
[2,5]

a terrain.
Aas
terrain
is a 2-dimensional surface in 3-dimensional
space with a special property: every vertical line
intersects it in a point, if it intersects it at all. A terrain
can be visualized with a perspective drawing like the
one in bellows Figure
To build a model of the terrain surface, we can
start with a number of sample points where we
know the height.
However, this gives a
discrete
terrain,
which doesnt look
very natural.

Delaunay Triangulation

5/9/2016

BETTER
OPTION:TRIANGULATION

[2]

Triangulation:

Planar
subdivision
whose
bounded
faces
are
triangles with vertices
Figure : Triangulation

Maximal

planar

subdivision:

a
subdivision S such that no edge connecting
two vertices can be added to S without
destroying its planarity
Triangulation of set of points P: a
maximal planar subdivision whose vertices
are elements of P.
4

Delaunay Triangulation

5/9/2016

Property of
Triangulation
Outer polygon must be

[2]
[2]

convex hull that is the

union of the bounded
faces of T is always the
convex hull of P, and
that the unbounded
face is always the
complement
of
the
convex hull.
Internal faces must be
triangles,
otherwise
they
could
beConvex Hull
triangulated further. 5
Delaunay Triangulation

5/9/2016

Terrain Problem,
Revisited
Here, Some triangles are better than other in
[3]
[3]

triangulation.
SO, now remain a question that-

But which triangulation is the most

appropriate one for our purpose, namely
to approximate a terrain??
So here we will avoid skinny triangles. That
means we will try maximize the minimum
angles which is basically DELAUNAY

TRIANGULATION
TERRAIN Problem solve by Angle Optimal
Triangulation(Edge Flipping) and Delaunay
Triangulation
SO,

Delaunay Triangulation

5/9/2016

Angle Optimal
To create aTriangulation
angle vector Let T be a triangulation
[2]
[2]

of P with m triangles. Its angle vector is A(T) =

(,,,.....,m)
where ,,,,m are
the angles of T sorted by increasing value.
Let T is another triangulation of P. Its angle
vector is A(T) = (,,,.......,m) Then we
say the angle-vector of T is larger than the
angle-vector of T if A(T) is lexicographically
larger than A(T) i.e A(T)> A(T).
So , Best triangulation is triangulation that is
angle optimal, i.e. has the largest angle vector.
That is Maximizes minimum angle. Then we say
the
triangulation T is7 angle-optimal if A(T)

Delaunay
Triangulation
5/9/2016

Edge flipping

[3]

If the two triangles form a convex

quadrilateral, we could have an
alternative
triangulation
by
performing
an Edge Flip Pon
their
l
Pl
shared
edge.

Pj

Edge Flip

Pi

Pj

Pi

Pk

Pk

Change the angle vector (,,) replaced by ,

,)

The edge e =
min

1i6

Delaunay Triangulation

Pi Pj

is

Illegal Edge if min

8

1i6

<

5/9/2016

Illegal & Legal

Triangulation
If triangulation
T contains an illegal edge
[1,4]

e, we can make A(T) larger by flipping e.

In this case, T is an illegal triangulation.
The edge PiPj is illegal if and only if Pl
lies in the interior of the circle C.
C
Pl
A legal triangulation is
a
triangulation that
Pj
does not contain any
illegal edge.
Pi

Flip illegal edges of

this triangulation until Illegal
Legal
all
edges are legal . 9 Edge
Delaunay
Triangulation
Edge

Pk
5/9/2016

Thales
Theorem
We can use Thales
Theorem to test if an edge
[2,3]
[2,3]

is legal without calculating angles

s
Denote
the
smaller
angle defined by three
points p, q, r.
Let C be a circle, l a line
intersecting C in points
a and b and p, q, r, and
s points lying on the
same side of l. Suppose
that p and q lie on C,
that r lies inside C, and
that s lies outside C.
Then:
Delaunay Triangulation

10

a
5/9/2016

Delaunay Graph

[1,2]
[1,2]

Delaunay Graph is a best solution of Terrain

Delaunay Graph of a set of points P is the dual graph G
Problem.
of the Voronoi diagram of P so we first must introduce
the Voronoi Diagram of P:
The subdivision of the plane P into n regions, one for
each site (point) in P, such that the region of a site p
P contains all points in the plane for which p is the
G
closest site. We denote this as Vor(P).

DUAL GRAPH
OF VOR(P)
Delaunay Triangulation

11

Vor(P
) 5/9/2016

The straight line embedding of a graph

G, which has a line connecting two
nodes if their corresponding Voronoi
cells share an edge, denoted as
Delaunay Graph of P ie. DG(P).

DG(P
)

Delaunay Triangulation

12

5/9/2016

Delaunay
If the point set
P is in general position then the
Triangulation
[1,3]
[1,3]

Delaunay graph is a triangulation.

General Position:

Pl

We say that a set of points in

general position if it contains no four points on a circle.
Therefore, P in general position means every vertex of the
Voronoi diagram has degree three, and consequently all
j
bounded faces of DG(P) are triangles.
P

DG(P)

Pi

VOR(P)

Pk

Delaunay Triangulation
Delaunay Triangulation

13

5/9/2016

Properties of Delaunay
Triangulation
[2,4,5]
[2,4,5]

1. Empty Circle
Property :
[5]
[5]

Let P be a set of points in the plane, and let T be a

triangulation of P. Then T is a Delaunay triangulation of P if
and only if the circumcircle of any triangle of T does not
contain a point of P in its interior.If the circumcircle of any
triangle does not contain other points of P then its called
Empty Circle property.

Delaunay Triangulation

14

5/9/2016

 2.Legal Edge Property :

[5]
[5]

Let P be a set of points in the plane. A

triangulation T of P is legal if and only if T is a
Delaunay triangulation of P.
C(P
iP
Pm

T is a legal triangulation of P that is not

Delaunay Triangulation.
As T is not Delaunay Triangulation so
there is a PiPjPk ,the circum circle

C(PiPjPk) contains a point Pl P in its

interior. Let e=PiPj
PiPjPl does not intersect PiPjPk

Pl
Pi

Now triangle PiPjPm adjacent to PiPjPk

along e. Since T is legal, e is legal.so Pm
does not lie in the interior circle of.

Pl C(PiPjPk). Now PmPjPl so this is not

intersect PiPjPm.
But by Thales Theorem, PjPlPi >

Acontradiction
as it allows
P jP m P i.
Delaunay Triangulation

jPm

Pj
k
C(PiPjP
)

PjPm to be flipped.

15

5/9/2016

 3.Maximize The Minimum Angle

Property :[4]
Let P be a set of points in the plane. Any angleoptimal triangulation of P is a Delaunay
Triangulation of P. That is any Delaunay
triangulation of P maximizes the minimum angle
over all triangulations of P.
min = 27
min = 50
After edge
flip for angle
optimal
triangulation

D
36

27

90
54

Delaunay Triangulation

10

485

63

57

A
16

33

50
55
102

B5/9/2016

A simple

Computing Delaunay
algorithm
to compute Delaunay Trianguletion.
Triangulation
[2]
[2]

It is

Randomize Incremental Construction

1. This algorithm start with a big triangle say

P-1P-2P-3 that
contains all the points. The vertices of this big triangle should
not be lie in any circle defined by 3 points in P.
2. Add one point Pr at a time, then add edges from Pr to the
verticies of the existing triangle.
3. Then two cases arise here:
Pr lies in the interior of the triangle. (figure: A)
Pr falls on an edge (need to make sure new edges are
legal by flipping edges if necessary). (figure B)

Pk

e
r
u
Fig
A
Pi
Delaunay Triangulation

Pi

Pr

Pl
Pr
Pj

17

Pj

Pk

re
u
F ig B
5/9/2016

Algorithm_Randomize_Incremental_Constr
uction[5]
[5]

Input: A set P of n points in the plane

Output: A Delaunay triangulation of P

1. Let p-1 , p-2 & p-3 be 3 point s.t. P is contained in

triangle p-1 p-2 p-3
2. Initialize T as triangulation consisting of a single
triangle p-1 p-2 p-3
3. Compute a random permutation p1 , , pn of P
4. for r 1 to n
5.
do (* Insert pr into T : *)
6.

Find a triangle pi pj pk T containing pr

7.

if pr lies in the interior of the triangle pi pj pk

8.

then Add edges from pr to 3 vertices of pi pj pk

and split it
18
Delaunay Triangulation
5/9/2016
9.
LegalizeEdge(p , p p , T)

12.
else (* pr lies on an edge of pi pj pk, say the
edge pi pj *)
13.
vertex of

Add edges from p r to pk and to the third

other triangle that is incident to pi pj ,

thereby
splitting 2 triangles incident to pi pj into
4 tris
14.

LegalizeEdge(pr , pi pl , T)

15.

LegalizeEdge(pr , pl pj , T)

16.

LegalizeEdge(pr , pj pk , T)

17.

LegalizeEdge(pr , pk pi , T)

18. Discard p-1 , p-2 and p-3 with all their incident edges
from T
19. return T
19
Delaunay Triangulation
5/9/2016

Algorithm_Legalize_Edge(pr ,
pi pj , T)
(* The point being inserted is pr , and pi pj is
the edge of T
that may need to be flipped *)
2. if pi pj is illegal
1.

3.

then Let pi pj pk be triangle adjacent to pr pi pj

along pi pj

4.

(* Flip pi pj *) Replace pi pj with pr pk

5.

LegalizeEdge(pr , pi pk , T)

6.

LegalizeEdge(pr , pk pj , T)

Delaunay Triangulation

20

5/9/2016

Example of Randomize Incremental

Construction[1]

This meet the Delaunay

Triangulation
Pk

But
,

Pj

P
r

Pi

Here after adding this Pr, the circum circle of

point contain some other point of set P.So,Now
edge for restore the Delaunay Property.
Delaunay Triangulation

21

this intirior
flipping the
5/9/2016

P
r

After flipping we get new two

tryangle and draw the circum
circle and check the Delaunay
Property,but this figure again
not
meet
the
Delaunay
Property.So we flipping the
Delaunay Triangulation

22

5/9/2016

After flipping edge we check

again Delaunay Property and
this triangulation meet the
Delaunay property because the
ciecum circle is not contain ny
othe
point.
So,
Now
this
triangulation

is

Triangulation.

Delaunay

P
r

This flipping is continue until the triangulation

becomes legal and every time flip only the diagonal
one of the end point of the diagonal is the new point
and then the previous triangles are legal so it must be
include the new point
Delaunay Triangulation

23

5/9/2016

Using Delaunay
Triangulations
Euclidean Minimum Spanning Trees

[2]

For a set P of n points in the plane,

the Euclidean Minimum Spanning
Tree is the graph with minimum
summed
edge
length
that
connects all points in P and has
only the points of P as vertices

The
Euclidean
Minimum
Spanning
Tree does not have
cycles. G is the shortest
Suppose

connected graph and it has a

cycle. Removing one edge from
the cycle makes a new graph G0
that is still connected but which
is shorter. Contradiction
Delaunay Triangulation

24

Euclidean
Minimum
Spanning Tree
5/9/2016

 Every edge of the Euclidean Minimum

Spanning Tree is an edge in the Delaunay
graph

Suppose T is an EMST with

an edge e = pq that is not
Delaunay
Consider
the
circle C that has e as its
diameter. Since e is not
Delaunay, C must contain
another point r in P.
Either the path in T from r
to p passes through q, or
vice versa. The cases are
symmetric, so we can
assume the former case.
Then
removing
e
and
inserting pr instead will
give a connected graph
again (in fact, a tree)
Since q was the furthest
Which is
point from p inside C, rnot
is
closer to q, so T was possible
not a
minimum
spanning tree.
25
Delaunay
Triangulation

P
e

r
T
T

W(T) > W(T) where

W(T)=W(T)+(q r) (p
q)
5/9/2016

Clustering Using Delaunay Triangulation[6]

Clustering is the process of grouping a set of objects into classes
or clusters so that objects within a cluster have similarity in
comparison to one another, but are dissimilar to objects in other
clusters.
Typically, the problem is that clusters identified with one method
cannot be detected by other methods .
Such information needs are supplied as density threshold values,
merge/ split conditions, number of parts, assumptions about the
distribution of continuous attributes within classes, and size for
intensity testing.This is extremely expensive and inefficient,
because the best-fit parameters are not easy to get
Clustering based on Delaunay triangulation is not a new and has
been described
solved this problem. because Delaunay
triangulation is a structure that is linear in the size of the data set
and implicitly contains vast amounts of proximity information.
That is to say, we can use the graph information of Delaunay
triangulation and metric information
to obtain remarkable robust
26
Delaunay Triangulation

5/9/2016

References
1. https://en.wikipedia.org/wiki/Delaunay_triangulation (Accessed on
30/8/16)
2. http://www.cs.uu.nl/docs/vakken/ga/slides9alt.pdf
30/8/16)

(Accessed

on

3. http://www.cse.iitm.ac.in/~
augustine/cs6100_even2012/slides/09_DelaunayTriangulation.pdf
(Accessed on 30/8/16)
4. https://www.youtube.com/watch?v=IqdSdbxrTsY
30/8/16)
5. http://www.cs.uu.nl/geobook/interpolation.pdf
30/8/16)

(Acecssed
(Accessed

on
on

6. http://file.scirp.org/pdf/JSEA20100200006_14742265.pdf(Accessed
on 1/9/16)
Delaunay Triangulation

27

5/9/2016

k
n
a
h
T

u
o
y