Recent progress in exact geometric computation
From MaRDI portal
(Redirected from Publication:1779568)
Recommendations
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4078610 (Why is no real title available?)
- scientific article; zbMATH DE number 4104362 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 62659 (Why is no real title available?)
- scientific article; zbMATH DE number 1241855 (Why is no real title available?)
- scientific article; zbMATH DE number 1296286 (Why is no real title available?)
- scientific article; zbMATH DE number 1305089 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- scientific article; zbMATH DE number 1947391 (Why is no real title available?)
- scientific article; zbMATH DE number 2079355 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746666 (Why is no real title available?)
- scientific article; zbMATH DE number 1746032 (Why is no real title available?)
- scientific article; zbMATH DE number 1875420 (Why is no real title available?)
- scientific article; zbMATH DE number 1424302 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 2247480 (Why is no real title available?)
- scientific article; zbMATH DE number 3057883 (Why is no real title available?)
- A new constructive root bound for algebraic expressions. (Extended abstract)
- A probabilistic analysis of the power of arithmetic filters
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- An axiomatic approach to robust geometric programs
- Automatic generation of staged geometric predicates
- Certification of numerical computation of the sign of the determinant of a matrix
- Checking geometric programs or verification of geometric structures
- Computational Geometry in C
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Constructive root bound for <tt> k </tt>-ary rational input numbers
- Designing programs that check their work
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- How to recognize zero?
- Hypergeometric functions in exact geometric computation
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Practical segment intersection with finite precision output
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Pseudo approximation algorithms, with applications to optimal motion planning
- Rounding Arrangements Dynamically
- Self-testing/correcting with applications to numerical problems
- Simplification of Nested Radicals
- Special issue: Implementation of geometric algorithms
- Structural filtering: a paradigm for efficient and exact geometric programs
- Topology-oriented implementation -- an approach to robust geometric algorithms
- Towards and open curved kernel
- Towards exact geometric computation
- Two design principles of geometric algorithms in finite-precision arithmetic
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- When Close Enough is Close Enough
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
- Certified computation of planar Morse-Smale complexes
- Restructuring expression dags for efficient parallelization
- 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
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)
