This paper attempts to present an expository summary on the numerical non-robustness issues in geometric computation. We try to give the answers to two questions: (1) why numerical non-robustness issues occur in geometric computing, and (2) how to deal with them in practice. We first describe the theoretical causes of the problematic robustness behaviors, and then present several popular and practical solutions to the non-robustness problem. Note that these algorithm-specific or general solutions are only part of the existing efforts to attack the numerical robustness problem, but are quite useful in practical applications. Additionally, geometric examples and sample codes are included for illustrations.
Digital Object Identifier (DOI)
Mei, Gang; C. Tipper, John; and Xu, Nengxiong
"Numerical Robustness in Geometric Computation: An Expository Summary,"
Applied Mathematics & Information Sciences: Vol. 08:
6, Article 7.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss6/7