Pages that link to "Item:Q3312804"
From MaRDI portal
The following pages link to Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons (Q3312804):
Displayed 13 items.
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Fuzzy distances for proximity characterization under uncertainty (Q1303965) (← links)
- An algorithm for computing the distance between two circular disks (Q1433675) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
- An approach to computing multipoint inversion and multiray surface intersection on parametric surface (Q2298351) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Point inversion and projection for nurbs curve and surface: control polygon approach (Q2388497) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects (Q5060127) (← links)
- A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784) (← links)