Name
Abstract | ||
|---|---|---|
Focusing on the problem of the low efficiency about the traditional incremental inserting algorithm, this paper carried on a intensive research in two aspects. Fist, the Virtual Grid is introduced into the improved algorithm and the discrete set of points is partitioned scientifically. Second, the insertion sequence about the discrete points is optimized. The improved algorithm can locate the triangle quickly and reduce the num of the triangles that need to be searched improving the efficiency of the incremental inserting algorithm. The result of simulating shows that the efficiency of the improved algorithm is higher than others and it can generate a Delaunay triangulation net more quickly. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/COGINF.2008.4639151 | PROCEEDINGS OF THE SEVENTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS |
Keywords | Field | DocType |
Triangulation Irregular Network (TIN), Delaunay Triangulation, Incremental Inserting Algorithm, Virtual Grid | Chew's second algorithm,Mathematical optimization,Bowyer–Watson algorithm,Minimum-weight triangulation,Surface triangulation,Constrained Delaunay triangulation,Mathematics,Pitteway triangulation,Ruppert's algorithm,Delaunay triangulation | Conference |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li-Chao Chen | 1 | 14 | 7.02 |
| Shaofang Xia | 2 | 0 | 0.34 |
| Jia Liu | 3 | 0 | 0.68 |