Pages that link to "Item:Q4057650"
From MaRDI portal
The following pages link to Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition (Q4057650):
Displayed 10 items.
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- On decomposing polygons into uniformly monotone parts (Q1108793) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- The Fibonacci search for cornerpoint detection of two-dimensional images (Q1206163) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)