Planar point sets with large minimum convex decompositions

DOI10.1007/S00373-012-1181-ZMaRDI QIDQ367041zbMATH OpenOpenAlexFDO

Authors J. García-López, Carlos M. Nicolás

Publication date 26 September 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL http://oa.upm.es/33183/

zbMATH Keywords

triangulationsempty polygonsconvex decompositionconvex decompositionssets with \(n\) points

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• On convex decompositions of a planar point set
• On a partition into convex polygons
• scientific article; zbMATH DE number 1786507
• scientific article; zbMATH DE number 2197927
• A note on convex decompositions of a set of points in the plane

Cites work

• scientific article; zbMATH DE number 1182907 (Why is no real title available?)
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• On convex decompositions of a planar point set
• Research Problems in Discrete Geometry

Cited in

(13)

• Linear-size planar Manhattan network for convex point sets
• Finite nondense point set analysis
• Decomposition of convex figures into similar pieces
• A decompositin theorem for convexity spaces
• On convex decompositions of a planar point set
• scientific article; zbMATH DE number 3893913 (Why is no real title available?)
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
• A note on convex decompositions of a set of points in the plane
• Computing low-cost convex partitions for planar point sets based on tailored decompositions (CG challenge)
• scientific article; zbMATH DE number 1786507 (Why is no real title available?)
• A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms

This page was built for publication: Planar point sets with large minimum convex decompositions

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