Pages that link to "Item:Q4229412"
From MaRDI portal
The following pages link to Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design (Q4229412):
Displayed 17 items.
- The unpredictable deviousness of models (Q959796) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q1602945) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Computing the Implicit Voronoi Diagram in Triple Precision (Q3183479) (← links)
- Robust Point-Location in Generalized Voronoi Diagrams (Q3628374) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS (Q4682157) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
- An elementary algorithm for reporting intersections of red/blue curve segments (Q5959559) (← links)