Decomposing a Polygon into Simpler Components

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

(47)

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

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)