Pages that link to "Item:Q1065550"
From MaRDI portal
The following pages link to Fast dynamic intersection searching in a set of isothetic line segments (Q1065550):
Displaying 6 items.
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency (Q1115624) (← links)
- Searching for segments with largest relative overlap (Q1186585) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)