Professional Documents
Culture Documents
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]
5/9/2016
Terrain Problem,
Revisited
Here, Some triangles are better than other in
[3]
[3]
triangulation.
SO, now remain a question that-
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]
Delaunay
Triangulation
5/9/2016
Edge flipping
[3]
Pj
Edge Flip
Pi
Pj
Pi
Pk
Pk
The edge e =
min
1i6
Delaunay Triangulation
Pi Pj
is
1i6
<
5/9/2016
Pk
5/9/2016
Thales
Theorem
We can use Thales
Theorem to test if an edge
[2,3]
[2,3]
10
a
5/9/2016
Delaunay Graph
[1,2]
[1,2]
DUAL GRAPH
OF VOR(P)
Delaunay Triangulation
11
Vor(P
) 5/9/2016
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]
Pl
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]
Delaunay Triangulation
14
5/9/2016
[5]
[5]
Pl
Pi
Acontradiction
as it allows
P jP m P i.
Delaunay Triangulation
jPm
Pj
k
C(PiPjP
)
PjPm to be flipped.
15
5/9/2016
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
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]
7.
8.
12.
else (* pr lies on an edge of pi pj pk, say the
edge pi pj *)
13.
vertex of
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.
4.
5.
LegalizeEdge(pr , pi pk , T)
6.
LegalizeEdge(pr , pk pj , T)
Delaunay Triangulation
20
5/9/2016
But
,
Pj
P
r
Pi
21
this intirior
flipping the
5/9/2016
P
r
22
5/9/2016
is
Triangulation.
Delaunay
P
r
23
5/9/2016
Using Delaunay
Triangulations
Euclidean Minimum Spanning Trees
[2]
The
Euclidean
Minimum
Spanning
Tree does not have
cycles. G is the shortest
Suppose
24
Euclidean
Minimum
Spanning Tree
5/9/2016
P
e
r
T
T
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