Recent progress in exact geometric computation
From MaRDI portal
Publication:1779568
DOI10.1016/j.jlap.2004.07.006zbMath1080.68106OpenAlexW1986405515MaRDI QIDQ1779568
Chen Li, Sylvain Pion, Chee-Keng Yap
Publication date: 1 June 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00344355/file/p.pdf
Interval arithmeticApproximate expression evaluationC++ librariesConstructive zero boundsExact geometric computationNon-robustness problemsNumerical filtersPrecision-driven computationRobust algorithms
Related Items
An adaptable and extensible geometry kernel, Efficient Predicate Evaluation Using Randomized Degeneracy Detection, Smoothing the Gap Between NP and ER, Improving root separation bounds, Algorithm for three-dimensional curved block cutting analysis in solid modeling, A regularization approach for estimating the type of a plane curve singularity, On the topology of real algebraic plane curves, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere, Hypergeometric Functions in Exact Geometric Computation, Classroom examples of robustness problems in geometric computations, A robust algorithm for geometric predicate by error-free determinant transformation, Foundations of Exact Rounding, Exact, efficient, and complete arrangement computation for cubic curves, Certified computation of planar Morse-Smale complexes
Uses Software
Cites Work
- Towards exact geometric computation
- Two design principles of geometric algorithms in finite-precision arithmetic
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- A probabilistic analysis of the power of arithmetic filters
- Checking geometric programs or verification of geometric structures
- Self-testing/correcting with applications to numerical problems
- An axiomatic approach to robust geometric programs
- How to recognize zero?
- Practical segment intersection with finite precision output
- Special issue: Implementation of geometric algorithms
- Topology-oriented implementation -- an approach to robust geometric algorithms
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Structural filtering: a paradigm for efficient and exact geometric programs
- When Close Enough is Close Enough
- Simplification of Nested Radicals
- Computational Geometry in C
- Designing programs that check their work
- Rounding Arrangements Dynamically
- Pseudo approximation algorithms, with applications to optimal motion planning
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Hypergeometric Functions in Exact Geometric Computation
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Automatic generation of staged geometric predicates
- Constructive root bound for <tt> k </tt>-ary rational input numbers
- Towards and open curved kernel
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Certification of numerical computation of the sign of the determinant of a matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
