Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657244 | The Journal of Logic and Algebraic Programming | 2005 | 27 Pages |
Abstract
Computational geometry has produced an impressive wealth of efficient algorithms. The robust implementation of these algorithms remains a major issue. Among the many proposed approaches for solving numerical non-robustness, Exact Geometric Computation (EGC) has emerged as one of the most successful. This survey describes recent progress in EGC research in three key areas: constructive zero bounds, approximate expression evaluation and numerical filters.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
C. Li, S. Pion, C.K. Yap,