#### Filter Results:

- Full text PDF available (185)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (37)
- Last 10 years (100)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ferran Hurtado, Marc Noy, Jorge Urrutia
- Discrete & Computational Geometry
- 1996

In this paper we study the problem of flipping edges in triangulations of polygons and point sets. One of the main results is that any triangulation of a set of n points in general position contains at least d(n − 4)/2e edges that can be flipped. We also prove that O(n + k2) flips are sufficient to transform any triangulation of an n-gon with k reflex… (More)

- Prosenjit Bose, Ferran Hurtado
- Comput. Geom.
- 2009

- Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia
- Comput. Geom.
- 2008

Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected plane geometric graphs. In particular, we show that for G to become 2-edge connected, 2n 3 additional edges are required in some cases and that 6n 7 additional edges are always… (More)

- Manuel Abellanas, Ferran Hurtado, Pedro Ramos
- Inf. Process. Lett.
- 1999

In this paper we consider the tolerance of a geometric or combinatorial structure associated to a set of points as a measure of how much the set of points can be perturbed while leaving the (topological or combinatorial) structure essentially unchanged. We concentrate on studying the Delaunay triangulation and show that its tolerance can be computed in O(n)… (More)

- David Avis, Bryan Beresford-Smith, +4 authors Binhai Zhu
- SIAM J. Comput.
- 1998

- Jérôme Galtier, Ferran Hurtado, Marc Noy, Stéphane Pérennes, Jorge Urrutia
- Int. J. Comput. Geometry Appl.
- 2003

We generalize the operation of flipping an edge in a triangulation to that of flipping several edges simultaneously. Our main result is an optimal upper bound on the number of simultaneous flips that are needed to transform a triangulation into another. Our results hold for triangulations of point sets and for polygons.

- Manuel Abellanas, Ferran Hurtado, +5 authors Vera Sacristán
- 2001

Suppose there are k types of facilities, e. g. schools, post offices, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location is in having at least one representative of each facility type in the neighborhood. In this paper we provide algorithms that may help to achieve this goal… (More)

- Ferran Hurtado, Marc Noy
- Ars Comb.
- 1997

- Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber
- Graphs and Combinatorics
- 2007

- David Bremner, Timothy M. Chan, +6 authors Perouz Taslakian
- Algorithmica
- 2006

We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓ p norm of the vector of distances between pairs of beads from opposite necklaces in the best perfect matching. We show surprisingly different… (More)