Pages that link to "Item:Q921915"
From MaRDI portal
The following pages link to Partitioning arrangements of lines. II: Applications (Q921915):
Displaying 27 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)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Efficient partition trees (Q1199132) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA (Q3405967) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Connected component and simple polygon intersection searching (Q5060096) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS (Q5300004) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
