Pages that link to "Item:Q4818554"
From MaRDI portal
The following pages link to ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554):
Displaying 15 items.
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Weighted skeletons and fixed-share decomposition (Q2483555) (← links)
- Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063) (← links)
- Planar and Toroidal Morphs Made Easier (Q5886038) (← links)
- Minimum convex partition of a constrained point set (Q5929323) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)
