#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Oswin Aichholzer, Franz Aurenhammer, Belén Palop
- Discrete & Computational Geometry
- 2002

The city Voronoi diagram is induced by quickest paths, in the <i>L</i> <inf>1</inf> plane speeded up by an isothetic transportation network. We investigate the rich geometric and algorithmic properties of city Voronoi diagrams, and report on their use in processing quickest-path queries.In doing so, we revisit the fact that not every Voronoi-type diagram… (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 farthest color and p the nearest c-colored site. This novel structure generalizes both the standard Voronoi diagram (k = 1) and the farthest site Voronoi diagram… (More)

- 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)

- Manuel Abellanas, Ferran Hurtado, +5 authors Belén Palop
- Inf. Process. Lett.
- 2003

We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less than or equal time to any other. We consider the time to follow a shortest time path to be the time distance between the two points. In this paper, we give a simple algorithm for… (More)

- Diego R. Llanos Ferraris, David Orden, Belén Palop
- 16th Euromicro Conference on Parallel…
- 2008

Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several 'dry-runs' before an acceptable chunk size is found. Other traditional scheduling methods were originally designed for loops with no dependences, so they are primarily focused in the problem of… (More)

- Oswin Aichholzer, Carmen Cortés, +7 authors Godfried T. Toussaint
- ArXiv
- 2000

A central problem in polymer physics and molecular biology is the reconfiguration of large molecules (modeled as polygons) such as circular DNA. Most of the research in this area involves computer-intensive Monte-Carlo simulations. One efficient method frequently used to generate random chains or polygons is to modify one such object into another using a… (More)

- Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
- Comput. Geom.
- 2008

We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which the travel speed is high. More specifically, one can travel from one endpoint of the walkway to the other at speed v > 1, but can only travel at unit speed between any other pair… (More)

- Diego R. Llanos Ferraris, Belén Palop
- Proceedings 20th IEEE International Parallel…
- 2006

This paper presents TPCC-UVa, an open-source implementation of the TPC-C benchmark intended to be used in parallel and distributed systems. TPCC-UVa is written entirely in C language and it uses the Post-greSQL database engine. This implementation includes all the functionalities described by the TPC-C standard specification for the measurement of both uni-… (More)

- Prosenjit Bose, Jean Cardinal, +4 authors Norbert Zeh
- CCCG
- 2009

We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with βskeletons for β ∈ [0, 1] (such as sublinear spanning ratio) with the added benefit of planarity (and consequently linear size and local routability).

- Greg Aloupis, Jean Cardinal, +4 authors Belén Palop
- Comput. Geom.
- 2010

A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distance between a pair of points is the minimum time required to move from one point to the other, with optional use of H. The highway hull H(S,H) of a point set S is the minimal set… (More)