4 papers
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
Justin Colannino, Mirela Damian, Ferran Hurtado +4
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly…
Point set stratification and Delaunay depth
Manuel Abellanas, Mercè Claverol, Ferran Hurtado
In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth funct…
On the Reflexivity of Point Sets
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado +4
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest nu…
Small Strictly Convex Quadrilateral Meshes of Point Sets
David Bremner, Ferran Hurtado, Suneeta Ramaswami +1
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we s…