Pages that link to "Item:Q1116270"
From MaRDI portal
The following pages link to Verifiable implementations of geometric algorithms using finite precision arithmetic (Q1116270):
Displayed 19 items.
- An exact general remeshing scheme applied to physically conservative voxelization (Q350168) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Applied computational geometry: Towards robust solutions of basic problems (Q915501) (← links)
- Polygon nesting and robustness (Q917303) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- Delaunay triangulations in three dimensions with finite precision arithmetic (Q1195754) (← links)
- Constructing strongly convex hulls using exact or rounded arithmetic (Q1201743) (← links)
- A perturbation scheme for spherical arrangements with application to molecular modeling (Q1265287) (← links)
- Robust gift wrapping for the three-dimensional convex hull (Q1337472) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- Three-dimensional convex hull as a fruitful source of diagrams (Q1978717) (← links)
- Constructing strongly convex approximate hulls with inaccurate primitives (Q2366235) (← links)
- Structural filtering: a paradigm for efficient and exact geometric programs (Q2486081) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- Of What Use Is Floating-Point Arithmetic in Computational Geometry? (Q3644731) (← links)
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES (Q4824660) (← links)
