A planar 3-convex set is indeed a union of six convex sets

DOI10.1007/s00454-012-9484-7zbMath1280.52001OpenAlexW1968179455MaRDI QIDQ1953065

Noa Nitzan, Micha A. Perles

Publication date: 7 June 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-012-9484-7

zbMATH Keywords

non-convexityvisually independentinvisibility graphseeing subsetValentine's theorem (57')

Mathematics Subject Classification ID

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

Related Items (1)

On three measures of non-convexity

Cites Work

• Unnamed Item
• A three point convexity property
• A closed \((n+1)\)-convex set in \({\mathbb{R}}^ 2\) is a union of \(n^ 6\) convex sets
• General decomposition theorems for m-convex sets in the plane
• Decomposition theorems for 3-convex subsets of the plane
• On visibility and covering by convex sets
• Finite Unions of Convex Sets

This page was built for publication: A planar 3-convex set is indeed a union of six convex sets