1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
# Test case from "An On-Line Algorithm for Constrained Delaunay Triangulation"
# (checks polygon optimization after inserting a constrained edge)
init 0 0 2500 2000
#ins_point 181 922
#ins_point 50 691
#ins_point 98 371
ins_point p1 355 669
ins_point 400 306
ins_point 667 977
ins_point 1192 96
ins_point 1158 1147
ins_point 1385 340
ins_point 1704 890
ins_point p2 1759 669
dump_anim polygon_1.anim
print 1
ins_cedge e1 p1 p2
dump_anim polygon_2.anim
print 2
# split the constrained edge
ins_point 800 669
dump_anim polygon_3.anim
print 3
#del_cedge e1
|
