Affiliation:
1. Computer Science, Purdue University, West Lafayette, IN 47907
Abstract
Geometric computation software tends to be fragile and fails occasionally. This robustness problem is rooted in the difficulty of making unambiguous decisions about incidence and nonincidence, fundamentally impairing layering the geometry software reliably. Additionally, geometric operations tend to have a large number of special and singular cases, further adding to the difficulty of creating dependable geometric software. We review the problem origins and ways to address it.
Subject
Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications,Software
Reference25 articles.
1. Lakos, J., 1996, Large-Scale C++ Software Design, Addison-Wesley, Reading, MA.
2. Hoffmann, C. M., Hopcroft, J., and Karasick, M., 1988, “Towards Implementing Robust Geometric Computations,” Proc. 4th ACM Symp. on Comp. Geometry, pp. 106–117.
3. Hoffmann, C. M., 1989, Geometric and Solid Modeling, An Introduction, Morgan Kaufman, San Mateo, CA.
4. Gavrilova, M., and Rokne, J. G., 2000, “Reliable Line Segment Intersection Testing,” CAD 32, pp. 737–746.
5. Ratschek, H., and Rokne, J., 1999, “Exact Computation of the Sign of a Finite Sum,” Appl. Math. Comp. , pp. 99–127.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献