Pages that link to "Item:Q918702"
From MaRDI portal
The following pages link to Efficient dynamic algorithms for some geometric intersection problems (Q918702):
Displaying 13 items.
- Geometric algorithms for finding a point in the intersection of balls (Q827997) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency (Q1115624) (← links)
- A random direction algorithm for an intersection problem (Q1195959) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA (Q3405967) (← links)
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS (Q4682199) (← links)
- Connected component and simple polygon intersection searching (Q5060096) (← links)
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization (Q5060128) (← links)
- Intersection Algorithms and CAGD (Q5424448) (← links)
