Classroom examples of robustness problems in geometric computations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 51521 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1424302 (Why is no real title available?)
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- An acyclicity theorem for cell complexes in d dimensions
- An efficient algorithm for determining the convex hull of a finite planar set
- Another efficient algorithm for convex hulls in two dimensions
- Applications of random sampling in computational geometry. II
- Backward Error Analysis in Computational Geometry
- Computing convex hull in a floating point arithmetic
- Constructing strongly convex approximate hulls with inaccurate primitives
- Controlled perturbation for Delaunay triangulations
- Delaunay triangulations in three dimensions with finite precision arithmetic
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- On the design of CGAL a computational geometry algorithms library
- Pitfalls in Computation, or why a Math Book isn't Enough
- Recent progress in exact geometric computation
- The quickhull algorithm for convex hulls
- WALKING IN A TRIANGULATION
Cited in
(26)- Backward Error Analysis in Computational Geometry
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Much Ado about Zero
- Semantics, specification logic, and Hoare logic of exact real computation
- Convex hulls of random order types
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
- Faster geometric algorithms via dynamic determinant computation
- A robust algorithm for geometric predicate by error-free determinant transformation
- Boolean algebra of two-dimensional continua with arbitrarily complex topology
- Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
- Simple floating-point filters for the two-dimensional orientation problem
- Of What Use Is Floating-Point Arithmetic in Computational Geometry?
- An interface-preserving moving mesh in multiple space dimensions
- Far-field reflector problem and intersection of paraboloids
- Floating-point arithmetic for computational geometry problems with uncertain data
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation
- Fourth- and higher-order interface tracking via mapping and adjusting regular semianalytic sets represented by cubic splines
- Certifying algorithms
- Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
- Reply to “Backward Error Analysis ...”
- Algorithms – ESA 2004
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
- Convex-hull algorithms: implementation, testing, and experimentation
- Smoothing the Gap Between NP and ER
- Exact computation for existence of a knot counterexample
This page was built for publication: Classroom examples of robustness problems in geometric computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479475)
