Recent progress in exact geometric computation
From MaRDI portal
Publication:1779568
DOI10.1016/J.JLAP.2004.07.006zbMATH Open1080.68106OpenAlexW1986405515MaRDI QIDQ1779568FDOQ1779568
Authors: Chen Li, Sylvain Pion, Chee K. 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
Recommendations
Interval arithmeticApproximate expression evaluationC++ librariesConstructive zero boundsExact geometric computationNon-robustness problemsNumerical filtersPrecision-driven computationRobust algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-testing/correcting with applications to numerical problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Title not available (Why is that?)
- Designing programs that check their work
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Computational Geometry in C
- Certification of numerical computation of the sign of the determinant of a matrix
- Title not available (Why is that?)
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two design principles of geometric algorithms in finite-precision arithmetic
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Checking geometric programs or verification of geometric structures
- How to recognize zero?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards exact geometric computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards and open curved kernel
- Special issue: Implementation of geometric algorithms
- Structural filtering: a paradigm for efficient and exact geometric programs
- A new constructive root bound for algebraic expressions. (Extended abstract)
- Rounding Arrangements Dynamically
- Title not available (Why is that?)
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Simplification of Nested Radicals
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- When Close Enough is Close Enough
- Practical segment intersection with finite precision output
- An axiomatic approach to robust geometric programs
- A probabilistic analysis of the power of arithmetic filters
- Automatic generation of staged geometric predicates
- Pseudo approximation algorithms, with applications to optimal motion planning
- Topology-oriented implementation -- an approach to robust geometric algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergeometric functions in exact geometric computation
- Constructive root bound for <tt> k </tt>-ary rational input numbers
Cited In (21)
- An adaptable and extensible geometry kernel
- Algorithm for three-dimensional curved block cutting analysis in solid modeling
- Exact, efficient, and complete arrangement computation for cubic curves
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- A robust algorithm for geometric predicate by error-free determinant transformation
- Improving root separation bounds
- Restructuring expression dags for efficient parallelization
- Certified computation of planar Morse-Smale complexes
- Hypergeometric functions in exact geometric computation
- Some progress on computational geometry
- Fast floating-point filters for robust predicates
- Towards soft exact computation (invited talk)
- Classroom examples of robustness problems in geometric computations
- Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
- Applied computational geometry: Towards robust solutions of basic problems
- On the topology of real algebraic plane curves
- Foundations of Exact Rounding
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection
- Exact geometric and algebraic computations in CGAL
- Smoothing the Gap Between NP and ER
- A regularization approach for estimating the type of a plane curve singularity
Uses Software
This page was built for publication: Recent progress in exact geometric computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779568)
