Solving the minimum convex partition of point sets with integer programming

A Sapucaia, PJ de Rezende, CC de Souza - Computational Geometry, 2021 - Elsevier
The partition of a problem into smaller sub-problems satisfying certain properties is often a
key ingredient in the design of divide-and-conquer algorithms. For questions related to …

[PDF][PDF] A Complete Bibliography of Publications in the Journal of Computational Geometry

NHF Beebe - 2020 - netlib.org
A Complete Bibliography of Publications in the Journal of Computational Geometry Page 1
A Complete Bibliography of Publications in the Journal of Computational Geometry Nelson …

[PDF][PDF] Computing Crossing-Free Configurations with Minimum Bottleneck

SP Fekete, P Keldenich - ibr.cs.tu-bs.de
We consider problems of finding non-crossing bottleneck structures for a given planar point
set: For a given a set of vertices V, the problem Minimum Bottleneck Polygon (MBP) is to find …