Pages that link to "Item:Q3694719"
From MaRDI portal
The following pages link to Decomposing a Polygon into Simpler Components (Q3694719):
Displayed 37 items.
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← 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)
- On gallery watchmen in grids (Q1087018) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- On covering orthogonal polygons with star-shaped polygons (Q1193845) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Optimal 2-coverage of a polygonal region in a sensor network (Q1662495) (← links)
- Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment (Q1664949) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM (Q3442762) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- Polygon Area Decomposition for Multiple-Robot Workspace Division (Q4513222) (← links)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
- INNER-COVER OF NON-CONVEX SHAPES (Q4819335) (← links)
- GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY (Q4824661) (← links)
- A Shape-Newton Approach to the Problem of Covering with Identical Balls (Q5071447) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Minimum convex partition of a constrained point set (Q5929323) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)
- Rectangularization of digital objects and its relation with straight skeletons (Q6166828) (← links)