Arc-based integer programming formulations for three variants of proportional symbol maps

TL;DR: In this article, a polygon-based integer programming formulation for the minimum convex partition problem (MCPP) is presented. But the problem is NP-hard, and it cannot be solved with a large number of points.

TL;DR: A novel polygon-based integer programming formulation is presented for the MCPP, which leads to better dual bounds than the previously known edge-based model and the combination of these techniques leads to the ability to solve instances with twice as many points as previously possible while constrained to identical computational resources.

TL;DR: The history of Cartography can be found in this paper, where the Earth and its Coordinate System are discussed. And the principles of map projection, color, scale and Cartographic Generalization are presented.

TL;DR: It is shown that the projection of a monotonized polyhedron on a subspace is the monotonization of the projections of the polyhedrons on the same subspace.

TL;DR: The solution to the Max-Min problem performs best on the data sets considered and several methods to compute stacking drawings are implemented, which can be improved to O(nlog n) time when the input has certain properties.