Robust geometric computation
In mathematics, specifically in computational geometry, geometric nonrobustness is a problem wherein branching decisions in geometric algorithms are predicated on approximate numerical computations, leading to various forms of unreliability including ill-formed output and software failure through crashing or infinite loops.
References
 | This geometry-related article is a stub. You can help Wikipedia by expanding it. |