Problem of partitioning a planar point set into empty convex polygons

MaRDI QIDQ2824967zbMATH OpenFDO

Authors Junmei Hu, Xinna Meng, Yaling Wang

Publication date 6 October 2016

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

empty convex partitionempty convex polygongeneral position

Mathematics Subject Classification ID

Partitions of sets (05A18) Elementary theory of partitions (11P81) Polytopes and polyhedra (52B99)

Recommendations

• Partitioning a planar point set into empty convex polygons
• Partitioning point sets in space into disjoint convex polytopes
• Disjoint empty convex polygons in planar point sets
• On empty convex polygons in a planar point set
• On empty convex polygons in a planar point set
• On pseudo-convex partitions of a planar point set
• Planar point sets with a small number of empty convex polygons
• Partitioning point sets in arbitrary dimension
• scientific article; zbMATH DE number 1159075

Cited in

(6)

• The \(n\)-point and six-partite point of a convex polygon
• On pseudo-convex partitions of a planar point set
• scientific article; zbMATH DE number 1150145 (Why is no real title available?)
• Partitioning a planar point set into empty convex polygons
• Disjoint empty convex polygons in planar point sets
• Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)

This page was built for publication: Problem of partitioning a planar point set into empty convex polygons

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