|
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Goal:
Divide the given
|
|
|
|
polygon
into triangles in such
|
|
|
a
way as to minimize the
|
|
|
lengths
of the added lines
|
|
|
| |
Application:
Has been used
|
|
|
|
for
shading in graphics
|
|
|
|
|
Intuition:
Min weight
|
|
|
|
triangulation
should be good
|
|
|
|
surface
approximation since
|
|
|
|
triangles
are small
|
|
|
|
|
Aside:
Delaunay
|
|
|
|
triangulation
may be better
|
|
|
|
choice
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Definitions:
|
|
|
|
|
Vertices are v1,...,vn
|
|
|
|
|
presented
in
|
|
|
|
counterclockwise
order
|
|
|
|
|
D[i,j]
holds the distance from
|
|
|
vi
to vj
|
|
|
|
|
C[i,j]
represents min cost for
|
|
|
|
triangulating
polygon vi,...,vj
|
|
|
|
|
Ck[i,j] represents cost of
|
|
|
|
|
optimal
triangulation of
|
|
|
|
polygon
vi,...,vj assuming
|
|
|
that
triangle vi vk vj is used
|
|
|
|