Name
Abstract | ||
|---|---|---|
We present a new surface simplification algorithm. The algorithm is based on iterative edge contracting, and exploits a new method to measure the cost of collapse which takes the length of contracting edge and the rotation of the normal vector to the related triangle into account. In addition, the proposed algorithm adopts the multiple-choice approach to find the simplification sequence, which leads to a significant speedup with reduced memory overhead |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICICIC.2006.452 | ICICIC (3) |
Keywords | Field | DocType |
optimisation,iterative edge contracting,simplification sequence,probabilistic optimization strategy,computational geometry,related triangle,fast surface simplification algorithm,significant speedup,proposed algorithm,new surface simplification algorithm,iterative edge contraction,fast surface simplification,reduced memory overhead,solid modelling,multiple-choice approach,normal vector rotation,weighted rotation,iterative methods,normal vector,vectors,new method,probability,multiple choice | Computer science,Control theory,Iterative method,Solid modelling,Computational geometry,Algorithm,Theoretical computer science,Normal,Speedup | Conference |
Volume | ISBN | Citations |
3 | 0-7695-2616-0 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shixiang Jia | 1 | 5 | 1.62 |
| Yongsheng Zhao | 2 | 75 | 19.66 |
| Xiaofeng Zhang | 3 | 44 | 4.84 |
| Lingyun Li | 4 | 0 | 0.34 |