Decomposing a Polygon into Simpler Components
From MaRDI portal
Recommendations
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- scientific article; zbMATH DE number 1424299
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- scientific article; zbMATH DE number 3986641
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Cited in
(49)- A generalized Winternitz theorem
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Approximation algorithms for decomposing octilinear polygons
- Algorithms for the decomposition of a polygon into convex polygons
- On gallery watchmen in grids
- Approximate convex decomposition of polygons
- Decomposing Octilinear Polygons into Triangles and Rectangles
- Rectangularization of digital objects and its relation with straight skeletons
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- scientific article; zbMATH DE number 4062591 (Why is no real title available?)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- Polygon decomposition and switching function minimization
- Uniformly monotone partitioning of polygons
- The distance between convex sets with Minkowski sum structure: application to collision detection
- Exact and approximation algorithms for computing optimal fat decompositions
- Minimum convex partition of a constrained point set
- Minimum convex partition of a polygon with holes by cuts in given directions
- Polynomial-time instances of the minimum weight triangulation problem
- scientific article; zbMATH DE number 2197927 (Why is no real title available?)
- Optimal 2-coverage of a polygonal region in a sensor network
- Recognizing polygons, or how to spy
- Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
- GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
- Dividing a polygon into two similar polygons
- Minimum star partitions of simple polygons in polynomial time
- Clique-width of point configurations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Minimum k-partitioning of rectilinear polygons
- Polygon decomposition for efficient construction of Minkowski sums
- Decomposition and intersection of simple splinegons
- Monotone partitions of simple polygons
- Locating guards for visibility coverage of polygons
- Covering orthogonal polygons with star polygons: The perfect graph approach
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- A shape-Newton approach to the problem of covering with identical balls
- Detecting the intersection of convex objects in the plane
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- scientific article; zbMATH DE number 515326 (Why is no real title available?)
- On partitioning rectilinear polygons into star-shaped polygons
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- scientific article; zbMATH DE number 2160477 (Why is no real title available?)
- scientific article; zbMATH DE number 1424443 (Why is no real title available?)
- INNER-COVER OF NON-CONVEX SHAPES
- Minimum \(r\)-star cover of class-3 orthogonal polygons
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- Triangulations, visibility graph and reflex vertices of a simple polygon
- On covering orthogonal polygons with star-shaped polygons
This page was built for publication: Decomposing a Polygon into Simpler Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694719)
