Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
