On convex decompositions of a planar point set

DOI10.1016/J.DISC.2008.02.008zbMATH Open1169.52007OpenAlexW1983056483MaRDI QIDQ1024490FDOQ1024490

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

decomposition problemcombinatorial convexityconvex hull of a point set

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Linear-size planar Manhattan network for convex point sets
• Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point
• On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
• Constrained independence system and triangulations of planar point sets
• Title not available (Why is that?)
• On the convex layers of a planar set
• Title not available (Why is that?)
• Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
• Open caps and cups in planar point sets
• A note on convex decompositions of a set of points in the plane
• On \(k\)-convex point sets
• On point sets fixing a convex body from within
• Planar point sets with large minimum convex decompositions

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

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