We give an overview of theoretical and practical aspects of finding a simple polygon of
minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the …

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 …

We study a variety of sparsification approaches for a spectrum of geometric optimization
problems related to tour problems, such as the Angular TSP, the Minimum Perimeter …

We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in
which, for a given input set ${\cal T} $ of trajectories in the plane, and an integer $ k\geq 2 …

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 …

Ailsa H. Land and her 1979 study of the traveling salesman problem: Personal reminiscences
and historical remarks - ScienceDirect Skip to main contentSkip to article Elsevier logo …

The traveling salesman problem (TSP) is considered among the most problem studying in
the combinatorial optimization, due to its real-life applications. It consists in finding a minimal …

For a given point set P or a polygon P, we consider the problem of finding a triangulation T
with minimum stabbing number, ie, a triangulation such that the maximal number of …