Efficient Predicate Evaluation Using Randomized Degeneracy Detection
From MaRDI portal
Publication:5057658
Cites work
- 3D boundary recovery by constrained Delaunay tetrahedralization
- A Complete Implementation for Computing General Dimensional Convex Hulls
- A deterministic algorithm for isolating real roots of a real polynomial
- A separation bound for real algebraic expressions
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
- Exact symbolic-numeric computation of planar algebraic curves
- Fast detection of degenerate predicates in free space construction
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 1305089 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- Interval arithmetic yields efficient dynamic filters for computational geometry
- MPFR
- Planar shape manipulation using approximate geometric primitives
- Recent progress in exact geometric computation
- Separation bounds for polynomial systems
- Sign determination in residue number systems
- Two approximate Minkowski sum algorithms
This page was built for publication: Efficient Predicate Evaluation Using Randomized Degeneracy Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057658)
