Pages that link to "Item:Q1567304"
From MaRDI portal
The following pages link to Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304):
Displaying 10 items.
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- Reporting curve segment intersections using restricted predicates (Q1581057) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Reporting intersections among thick objects. (Q1853186) (← links)
- Optimal and suboptimal robust algorithms for proximity graphs (Q1873154) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Moving coins (Q2489547) (← 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)