Theory of Real Computation According to EGC

The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric algorithms. Its technology has been encoded in libraries such as LEDA, CGAL and Core Library. The key feature of EGC is the necessity to decide zero in its computation. This paper addresses the problem of providing a foundation for the EGC mode of computation. This requires a theory of real computation that properly addresses the Zero Problem. The two current approaches to real computation are represented by the analytic school and algebraic school. We propose a variant of the analytic approach based on real approximation.

• Type: Conference
• Year: 2008
• Where: DAGSTUHL
• Authors: Chee-Keng Yap
• Keywords: DAGSTUHL 2008, Exact Geometric Computation, Explicit Rings, Real Computation, Software Engineering