Pages that link to "Item:Q4943876"
From MaRDI portal
The following pages link to Robust Plane Sweep for Intersecting Segments (Q4943876):
Displaying 13 items.
- The unpredictable deviousness of models (Q959796) (← links)
- On the degree of standard geometric predicates for line transversals in 3D (Q1025306) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q1602945) (← links)
- Rounding Voronoi diagram (Q1603650) (← links)
- Practical segment intersection with finite precision output (Q1818114) (← links)
- Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
- Line segment intersection testing (Q2572945) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
- Computing the Implicit Voronoi Diagram in Triple Precision (Q3183479) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- An elementary algorithm for reporting intersections of red/blue curve segments (Q5959559) (← links)
- Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)