Pages that link to "Item:Q1263966"
From MaRDI portal
The following pages link to Implicitly representing arrangements of lines or segments (Q1263966):
Displaying 22 items.
- Optimal partition trees (Q420575) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Rectilinear decompositions with low stabbing number (Q1341685) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Computing common tangents without a separating line (Q5057432) (← links)
