#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1990

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- 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… (More)

- Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos
- Int. J. Comput. Geometry Appl.
- 2009

Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and an edge exists between two points p, q ∈ P when there is a circle through p and q with at most k… (More)

- Manuel Abellanas, Jesús García-López, Gregorio Hernández-Peñalver, Marc Noy, Pedro Ramos
- Graph Drawing
- 1996

- 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… (More)

- Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
- Comput. Geom.
- 2006

We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined… (More)

The MIR Voronoi diagram appears with the notion of good illumination introduced in [3, 4]. This illumination concept generalizes well-covering [7] and triangle guarding [9]. The MIR Voronoi diagram… (More)

- Manuel Abellanas, Isabel Lillo, M. Dolores López, Javier Rodrigo
- European Journal of Operational Research
- 2006

We consider a problem of Political Economics with two opposed political parties. They will attempt to capture the greatest number of voters of a discrete population of elements. It is supposed that… (More)

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

Given n point sites in the plane each painted in one of k colors, the region of a c-colored site p in the Farthest Color Voronoi Diagram (FCVD) contains all points of the plane for which c is the… (More)

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

In this paper we consider the toleranceof 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… (More)

- Manuel Abellanas, Prosenjit Bose, +4 authors Javier Tejel
- Comput. Geom.
- 2008

Given two n-vertex plane graphs G1 and G2 embedded in the n × n grid with straight-line segments as edges, we show that with a sequence of O(n) point moves (all point moves stay within a 5n × 5n… (More)