Abstract On Properties of Higher Order Delaunay Graphs with Applications ∗ (2008)
Manuel Abellanas, Prosenjit Bose, Jesús García, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos
In this work we study the order-k Delaunay graph, which is formed by edges pq having a circle through p and q and containing no more than k sites. We study the combinatorial structure of the set of...
Separability by two lines and by flat polygonals ∗ (2007)
Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N log N)-time optimal algorithms for computing all the...
Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
In this paper we study the separability of two disjoint object sets in the plane by two criteria: we want to know if there is a wedge or a strip separating the object sets. In the affirmative case,...
Best Fitting Rectangles (2007)
Manuel Abellanas Ferran, Ferran Hurtado, Christian Icking, Lihong Ma, Belén Palop, Pedro A. Ramos
January 2003 1
On properties of higherorder Delaunay graphs with applications (2005)
Manuel Abellanas, Prosenjit Bose, Jesús García, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos
In this work we study the order-k Delaunay graph, which is formed by edges pq having a circle through p and q and containing no more than k sites. We study the combinatorial structure of the set of...
Best Fitting Rectangles (2004)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Lihong Ma, Belén Palop, Pedro A. Ramos
We solve an interesting optimization problem motivated by tolerancing metrology, paper position sensing, and facility location: What rectangle fits best a given set of points? This problem has...
Separating objects in the plane by wedges and strips (1998)
Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the...