On convex decompositions of a planar point set

DOI10.1016/j.disc.2008.02.008zbMath1169.52007OpenAlexW1983056483MaRDI QIDQ1024490

Kiyoshi Hosono

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.008

zbMATH Keywords

combinatorial convexitydecomposition problemconvex hull of a point set

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (2)

Planar point sets with large minimum convex decompositions ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets

Cites Work

• A note on convex decompositions of a set of points in the plane
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles

This page was built for publication: On convex decompositions of a planar point set