Pages that link to "Item:Q1182080"
From MaRDI portal
The following pages link to A simple algorithm for determining the envelope of a set of lines (Q1182080):
Displaying 10 items.
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- A fast algorithm for an envelope construction of a huge set of topologically consistent polygons (Q2575283) (← links)
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- PROPERTIES OF ARRANGEMENT GRAPHS (Q4661879) (← links)
- Optimal algorithms for separating a polyhedron from its single-part mold (Q6640038) (← links)