Pages that link to "Item:Q914373"
From MaRDI portal
The following pages link to Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373):
Displayed 8 items.
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← 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)
- Ray shooting on triangles in 3-space (Q2366231) (← links)