Pages that link to "Item:Q3613768"
From MaRDI portal
The following pages link to Reliable and Efficient Computational Geometry Via Controlled Perturbation (Q3613768):
Displaying 16 items.
- Combinatorial properties of support vectors of separating hyperplanes (Q499715) (← links)
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order (Q543787) (← links)
- A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
- Verifiable implementations of geometric algorithms using finite precision arithmetic (Q1116270) (← links)
- A paradigm for robust geometric algorithms (Q1185288) (← links)
- Efficient perturbations for handling geometric degeneracies (Q1364354) (← links)
- The nature and meaning of perturbations in geometric computing (Q1380782) (← links)
- Realistic input models for geometric algorithms (Q1849788) (← links)
- Controlled perturbation for Delaunay triangulations (Q2921776) (← links)
- Exact Fast Parallel Intersection of Large 3-D Triangular Meshes (Q3296633) (← links)
- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge (Q3644710) (← links)
- Of What Use Is Floating-Point Arithmetic in Computational Geometry? (Q3644731) (← links)
- Numerical Software with Result Verification (Q5308349) (← links)
- Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework (Q5745394) (← links)
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic (Q5747867) (← links)
