Pages that link to "Item:Q3316124"
From MaRDI portal
The following pages link to A new linear algorithm for intersecting convex polygons (Q3316124):
Displayed 11 items.
- 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)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
- Predicting mesh density for adaptive modelling of the global atmosphere (Q3579039) (← links)
- EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS (Q4818556) (← links)
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING (Q4818561) (← links)
- An application of the onion peeling algorithm for fingerprint verification purposes (Q5490150) (← links)