Reconfirmation of Two Results on Disjoint Empty Convex Polygons

DOI10.1007/978-3-540-70666-3_23zbMath1149.52300OpenAlexW1488784459MaRDI QIDQ3595420

Liping Wu, Ren Ding

Publication date: 28 August 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70666-3_23

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Related Items (5)

Every large point set contains many collinear points or an empty pentagon ⋮ A note on the value in the disjoint convex partition problem ⋮ Disjoint empty convex pentagons in planar point sets ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ A note on the upper bound for disjoint convex partitions

This page was built for publication: Reconfirmation of Two Results on Disjoint Empty Convex Polygons