We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...