Pages that link to "Item:Q582900"

The following pages link to The complexity and construction of many faces in arrangements of lines and of segments (Q582900):

Displayed 34 items.

• The complexity of many cells in arrangements of planes and related problems (Q582901) ‎ (← links)
• Reaching a goal with directional uncertainty (Q673767) ‎ (← links)
• A deterministic view of random sampling and its use in geometry (Q751816) ‎ (← links)
• Merging visibility maps (Q808306) ‎ (← links)
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) ‎ (← links)
• An optimal algorithm for the boundary of a cell in a union of rays (Q911755) ‎ (← links)
• Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) ‎ (← links)
• Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) ‎ (← links)
• Partitioning arrangements of lines. II: Applications (Q921915) ‎ (← links)
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) ‎ (← links)
• Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) ‎ (← links)
• The number of edges of many faces in a line segment arrangement (Q1200271) ‎ (← links)
• Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) ‎ (← links)
• Minimum-link paths among obstacles in the plane (Q1201747) ‎ (← links)
• On the general motion-planning problem with two degrees of freedom (Q1262130) ‎ (← links)
• Implicitly representing arrangements of lines or segments (Q1263966) ‎ (← links)
• On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) ‎ (← links)
• On the union of fat wedges and separating a collection of segments by a line (Q1314526) ‎ (← links)
• An improved technique for output-sensitive hidden surface removal (Q1322562) ‎ (← links)
• Castles in the air revisited (Q1334929) ‎ (← links)
• On lines missing polyhedral sets in 3-space (Q1334933) ‎ (← links)
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) ‎ (← links)
• Excess in arrangements of segments (Q1349964) ‎ (← links)
• The common exterior of convex polygons in the plane (Q1367170) ‎ (← links)
• Shattering a set of objects in 2D (Q1613422) ‎ (← links)
• New lower bounds for Hopcroft's problem (Q1816464) ‎ (← links)
• Robot motion planning and the single cell problem in arrangements (Q1842755) ‎ (← links)
• Arrangements of segments that share endpoints: Single face results (Q1892408) ‎ (← links)
• On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) ‎ (← links)
• Lines in space: Combinatorics and algorithms (Q1913699) ‎ (← links)
• Combinatorial complexity of signed discs (Q1917033) ‎ (← links)
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) ‎ (← links)
• Triangles in space or building (and analyzing) castles in the air (Q2638823) ‎ (← links)
• REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY (Q4682175) ‎ (← links)