Verifiable implementations of geometric algorithms using finite precision arithmetic
From MaRDI portal
Publication:1116270
DOI10.1016/0004-3702(88)90061-6zbMath0665.65014OpenAlexW2048401959MaRDI QIDQ1116270
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(88)90061-6
geometric algorithmsround-off errorsfinite precisionalgorithmic implementationsdata normalizationedge crackinggeometric operationshidden variable methodplanar polygon regionstopological arrangement of lines in the plane
Roundoff error (65G50) Artificial intelligence (68T99) Algorithms for approximation of functions (65D15) Software, source code, etc. for problems pertaining to geometry (51-04)
Related Items
Constructing strongly convex approximate hulls with inaccurate primitives, Robust gift wrapping for the three-dimensional convex hull, CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES, An exact general remeshing scheme applied to physically conservative voxelization, An intersection-sensitive algorithm for snap rounding, Compaction and separation algorithms for non-convex polygons and their applications, Applied computational geometry: Towards robust solutions of basic problems, Polygon nesting and robustness, Three-dimensional convex hull as a fruitful source of diagrams, Why is the 3D Delaunay triangulation difficult to construct?, Evaluating signs of determinants using single-precision arithmetic, Delaunay triangulations in three dimensions with finite precision arithmetic, Constructing strongly convex hulls using exact or rounded arithmetic, Structural filtering: a paradigm for efficient and exact geometric programs, Recent progress in exact geometric computation, A perturbation scheme for spherical arrangements with application to molecular modeling, Of What Use Is Floating-Point Arithmetic in Computational Geometry?, A robust algorithm for bisecting a triconnected graph with two resource sets, Robust algorithms for constructing strongly convex hulls in parallel.
Cites Work
