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.
Robustness in Geometric Computations*
Contributed by the Computer Aided Product Development Committee for publication in the JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING. Manuscript received Feb. 2001; revised Mar. 2001. Technical Editor: D. Nau.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Hoffmann, C. M. (March 1, 2001). "Robustness in Geometric Computations." ASME. J. Comput. Inf. Sci. Eng. June 2001; 1(2): 143–155. https://doi.org/10.1115/1.1375815
Download citation file:
- Ris (Zotero)
- Reference Manager