scientific article
From MaRDI portal
Publication:3750120
zbMath0609.68035MaRDI QIDQ3750120
David P. Dobkin, Bernard Chazelle
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingSteiner pointspolynomial timegeometric complexityoptimal convex decompositiondecomposition of a simple polygon into a minimum number of convex polygons
Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Related Items (25)
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions ⋮ Decomposition and intersection of simple splinegons ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Convex Partitions with 2-Edge Connected Dual Graphs ⋮ Cooperative search by multiple unmanned aerial vehicles in a nonconvex environment ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ Triangulations, visibility graph and reflex vertices of a simple polygon ⋮ SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition ⋮ Graph problems arising from parameter identification of discrete dynamical systems ⋮ Locking-free compressible quadrilateral finite elements: Poisson's ratio-dependent vector interpolants ⋮ Minimum k-partitioning of rectilinear polygons ⋮ Convex partitions with 2-edge connected dual graphs ⋮ Algorithms for the decomposition of a polygon into convex polygons ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ Detecting the intersection of convex objects in the plane ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ A Bound on a Convexity Measure for Point Sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ A virtual element method for transversely isotropic hyperelasticity ⋮ Approximate convex decomposition of polygons ⋮ Polygon decomposition for efficient construction of Minkowski sums ⋮ 3-Colored Triangulation of 2D Maps ⋮ DECOPOL -- Codes for decomposing a polygon into convex subpolygons ⋮ On convex partitions of polygonal regions
This page was built for publication:
