Pages that link to "Item:Q914373"
From MaRDI portal
The following pages link to Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373):
Displaying 14 items.
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- An improved technique for output-sensitive hidden surface removal (Q1322562) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)
