Pages that link to "Item:Q1200271"
From MaRDI portal
The following pages link to The number of edges of many faces in a line segment arrangement (Q1200271):
Displaying 15 items.
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- On the maximal number of edges of many faces in an arrangement (Q1071264) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- On the boundary of the union of planar convex sets (Q1289237) (← links)
- Multicolor combination lemma (Q1305889) (← links)
- Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines'' (Q1328765) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- Drawing graphs using a small number of obstacles (Q1702349) (← links)
- Arrangements of segments that share endpoints: Single face results (Q1892408) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
