scientific article; zbMATH DE number 3986641

MaRDI QIDQ3750120zbMATHFDO

Authors David P. Dobkin, Bernard Chazelle

Publication date 1985

zbMATH Keywords

dynamic programmingSteiner pointspolynomial timegeometric complexityoptimal convex decompositiondecomposition of a simple polygon into a minimum number of convex polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• scientific article; zbMATH DE number 4211553
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Algorithms for the decomposition of a polygon into convex polygons
• Approximate convex decomposition of polygons

Cited in

(40)

• DECOPOL -- Codes for decomposing a polygon into convex subpolygons
• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
• Polygon decomposition and switching function minimization
• Algorithms for the decomposition of a polygon into convex polygons
• Convex Partitions with 2-Edge Connected Dual Graphs
• Detecting the intersection of convex objects in the plane
• Approximate convex decomposition of polygons
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• scientific article; zbMATH DE number 519872 (Why is no real title available?)
• Minimum convex partition of a polygon with holes by cuts in given directions
• Minimum k-partitioning of rectilinear polygons
• Decomposing a Polygon into Simpler Components
• Polygon decomposition for efficient construction of Minkowski sums
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Decomposition and intersection of simple splinegons
• A virtual element method for transversely isotropic hyperelasticity
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 6387439 (Why is no real title available?)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
• A decompositin theorem for convexity spaces
• On convex partitions of polygonal regions
• Uniformly monotone partitioning of polygons
• Locking-free compressible quadrilateral finite elements: Poisson's ratio-dependent vector interpolants
• A bound on a convexity measure for point sets
• Approximation algorithms for decomposing octilinear polygons
• On decomposing polygons into uniformly monotone parts
• Decomposition of Catalan numbers and convex polygon triangulations
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Polygon vertex extremality and decomposition of polygons
• Convexity and closure in optimal allocations determined by decomposable measures
• Convex partitions with 2-edge connected dual graphs
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
• Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
• Triangulations, visibility graph and reflex vertices of a simple polygon
• Graph problems arising from parameter identification of discrete dynamical systems
• SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition
• Exact and approximation algorithms for computing optimal fat decompositions
• 3-colored triangulation of 2D maps

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750120)