Partitioning a planar point set into empty convex polygons

DOI10.1007/B11261MaRDI QIDQ5897095zbMATH OpenOpenAlexFDO

Authors Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu, Ren Ding

Publication date 5 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11261

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• Problem of partitioning a planar point set into empty convex polygons
• scientific article; zbMATH DE number 1150145
• scientific article; zbMATH DE number 1786507
• On a partition into convex polygons
• On the empty convex partition of a finite set in the plane.

Cited in

(17)

• On polygons enclosing point sets. II
• The \(n\)-point and six-partite point of a convex polygon
• Partitioning point sets in space into disjoint convex polytopes
• Dispersing and grouping points on planar segments
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Bottleneck convex subsets: finding k large convex sets in a point set
• Problem of partitioning a planar point set into empty convex polygons
• Recognition of largest empty orthoconvex polygon in a point set
• scientific article; zbMATH DE number 1150145 (Why is no real title available?)
• scientific article; zbMATH DE number 2073966 (Why is no real title available?)
• More on empty convex quadrilaterals in a planar point set
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• 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)
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
• On the minimum number of mutually disjoint holes in planar point sets
• On the number of empty convex quadrilaterals of a finite set in the plane

This page was built for publication: 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 Q5897095)