The following pages link to Towards exact geometric computation (Q676577):
Displaying 21 items.
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (Q625206) (← links)
- A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
- On design and implementation of a generic number type for real algebraic number computations based on expression dags (Q655162) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- On the degree of standard geometric predicates for line transversals in 3D (Q1025306) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q1602945) (← links)
- Rounding Voronoi diagram (Q1603650) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Algorithm for three-dimensional curved block cutting analysis in solid modeling (Q2175279) (← links)
- A robust segment/triangle intersection algorithm for interference tests. Efficiency study (Q2269834) (← links)
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments (Q2371337) (← links)
- A separation bound for real algebraic expressions (Q2391181) (← links)
- Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm (Q2819272) (← links)
- INFLATING BALLS IS NP-HARD (Q2893458) (← links)
- Computing the Implicit Voronoi Diagram in Triple Precision (Q3183479) (← links)
- Trustworthy Graph Algorithms (Invited Talk) (Q5092359) (← links)
- Restructuring Expression Dags for Efficient Parallelization (Q5140732) (← links)
