Pages that link to "Item:Q3316124"
From MaRDI portal
The following pages link to A new linear algorithm for intersecting convex polygons (Q3316124):
Displaying 9 items.
- An improved algorithm for intersecting convex polygons (Q286975) (← links)
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← links)
- Fixed-radius near neighbors search algorithms for points and segments (Q916423) (← links)
- Developing scheduling systems for Daewoo shipbuilding: DAS project (Q1278636) (← links)
- Restricted center problems under polyhedral gauges (Q1291660) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains (Q6082608) (← links)
