David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
Abstract. 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 show that...
Ferran Hurtado, Marc Noy, Jorge Urrutia Z
Given a triangulation T of a set P of points on the plane, an edge e of T is ippable if it is incident totwo triangles whose union is a convex quadrilateral C. By ipping e we mean the operation of...
Fabila-Monroy, Ruy, Flores-Peñaloza, David, Huemer, Clemens, Hurtado, Ferran, Urrutia, Jorge, Wood, David R.
For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their...
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009)
Abel, Zachary, Ballinger, Brad, Bose, Prosenjit, Collette, Sébastien, Dujmović, Vida, Hurtado, Ferran, ...
We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon....
Games on Triangulations (2009)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games—constructing, transforming, and marking...
Geometric Games on Triangulations Extended Abstract (2009)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
Let S be a set of n points in the plane, which we assume to be in general position, i.e., no three points of S lie on the same line. A triangulation of S is a simplicial decomposition of its convex...
Geometric Games on Triangulations Extended Abstract (2009)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
1 Introduction Let S be a set of n points in the plane, which we assume to be in general position, i.e., no threepoints of S lie on the same line. A triangulation of S is a simplicial decomposition...
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, Carlos Seara, Shakhar Smorodinsky
Given a set P of points in the plane, a set of points Q is a weak ε-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing ε|P | points...
Shortest Tour of a Sequence of Disjoint Segments in L1 (2008)
Esther Arkin, Alon Efrat, Cesim Erten, Ferran Hurtado, Joseph Mitchell
Abstract Given a sequence s1,..., sK of K disjoint segments in the plane, a start point s and a target point t, we seek a path, that starts at s, visits in order each of the segments, and ends at t,...
1 Introduction Small Weak Epsilon Nets (2008)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, Shakhar Smorodinsky, Carlos Seara
Let P be a set of n points in R 2. A point q (not
Playing with Triangulations (2008)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking...
Geometric Games on Triangulations Extended Abstract (2008)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
Let S be a set of n points in the plane, which we assume to be in general position, i.e., no three points of S lie on the same line. A triangulation of S is a simplicial decomposition of its convex...
Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Hurtado, Ferran, Langerman, Stefan, O'Rourke, Joseph, ...
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...
A Lower Bound on the Area of a 3-Coloured Disk Packing (2008)
Brass, Peter, Hurtado, Ferran, Lafreniere, Benjamin, Lubiw, Anna
Given a set of unit-disks in the plane with union area $A$, what fraction of $A$ can be covered by selecting a pairwise disjoint subset of the disks? Rado conjectured 1/4 and proved $1/4.41$....
On the Chromatic Numbers of some Flip Graphs (2008)
Ruy Fabila-monroy, David Flores-peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood
This paper studies the chromatic number of the following four flip graphs (under suitable definitions of a flip): • the flip graph of perfect matchings of a complete graph of even order, • the...
Necklaces, Convolutions, and X + Y (2008)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, ...
Abstract. 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...
The Rotation Graph of k-ary Trees is Hamiltonian ∗ (2008)
Clemens Huemer, Ferran Hurtado, Julian Pfeifle
In this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we...
The weighted farthest color Voronoi diagram on trees and (2008)
Ferran Hurtado, Vera Sacristán
graphs
Traversing a Set of Points with a Minimum Number of Turns ABSTRACT (2008)
Given a finite set of points S in Ê d, consider visiting the points in S with a polygonal path that makes a minimum number of turns, or equivalently, has the the minimum number of segments (links)....
Efficient Many-To-Many Point Matching in One Dimension (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Suneeta Ramaswami, Diane Souvaine, ...
Abstract. Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least...
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs ∗ (2008)
Manuel Abellanas, Prosenjit Bose, Jesús García, Ferran Hurtado
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...
Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias
It is well known that one can always polygonize a set ¥ of ¦¨§� © points in the plane (not all on a line), i.e., construct a simple polygon � whose vertices are precisely the given points in...
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...
Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane graphs and connected plane graphs as well as the...
Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, ...
∗ Partially supported by MCYT-FEDER BFM2003-00368, Gen. Cat 2001SGR00224 and Gen. Cat 2005SGR00692
Justin Colannino, Ferran Hurtado, Henk Meijer, Godfried Toussaint, Mirela Damian, John Iacono, ...
The restriction scaffold assignment problem takes as input two finite point sets S and T (with S containing more points than T) and establishes a correspondence between points in S and points in T,...
Optimal Location of Transportation Devices (2008)
Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
Abstract. 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...
CONNECTIVITY–PRESERVING TRANSFORMATIONS OF BINARY IMAGES (2008)
Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Pat Morin
ABSTRACT. A binary image I is Ba, Wb-connected, where a, b ∈ {4, 8}, if its foreground is a-connected and its background is b-connected. We consider a local modification of a Ba, Wb-connected image...
March 25, 2005 8:15 WSPC/Guidelines chordsep SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (2008)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, ...
∗Partially supported by DURSI 2001SGR00224, Acció Integrada UPC-McGill (DURSI2004) and
On Polyhedra Induced by Point Sets in Space ∗ (2008)
Ferran Hurtado, Godfried T. Toussaint, Joan Trias
Given a set S of n ≥ 3 points in the plane (not all on a line) it is well known that it is always possible to polygonize S, i.e., construct a simple polygon P such that the vertices of P are...
Ferran Hurtado, Departament Matemática, Aplicada Ii, Carlos Seara, Departament Matemática Aplicada, Saurabh Sethia
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane.
CONNECTIVITY–PRESERVING TRANSFORMATIONS OF BINARY IMAGES (2008)
Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Pat Morin
ABSTRACT. A binary image I is Ba, Wb-connected, where a, b ∈ {4, 8}, if its foreground is a-connected and its background is b-connected. We consider a local modification of a Ba, Wb-connected image...
March 25, 2005 14:14 WSPC/Guidelines chordsep SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (2008)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, ...
∗Partially supported by DURSI 2001SGR00224, Acció Integrada UPC-McGill (DURSI2004) and
Necklaces, Convolutions, and X + Y (2008)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, ...
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...
Efficient Many-To-Many Point Matching in One Dimension (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Diane Souvaine, ...
Appears in Graphs and Combinatorics, vol. 23 (2007), supplement, Computational Geometry and Graph Theory. The Akiyama-Chvatal Festschrift. The original publication is available at...
Necklaces, Convolutions, and X + Y (2008)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, ...
Abstract. 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...
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, ...
The restriction sca#old assignment problem takes as input two finite point sets S and T (with S containing more points than T ) and establishes a correspondence between points in S and points in T ,...
On Polyhedr Induced by Point Sets in Space (2008)
Ferran Hurtado, Godfried T. Toussaint, Joan Trias
Given a set Sof n points in the plane (not all on a line) it is well known that it is always possible to polygonize S, i.e., construct a simple polygon P such that the P are precisely the given...
Small Convex Quadrangulations of Point Sets (2008)
David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
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 show that 3b 2 c...
Games on Triangulations (2008)
Oswin Aichholzer David, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games---constructing, transforming, and marking...
ported by the Austrian FWF Joint Research Project ’Industrial Geometry ’ S9205-N12. (2008)
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, ...
Abstract: This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our first...
Matching edges and faces in polygonal partitions (2008)
Aichholzer, Oswin, Aurenhammer, Franz, Gonzalez-Nava, Paola, Hackl, Thomas, Huerner, Clemens, Hurtado, Ferran, ...
Matching points with squares (2008)
Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-merchant, Ferran Hurtado, Mikio Kano, ...
Given a class C of geometric objects and a point set P, a C-matching of P is a set M = {C1,...,Ck} ⊆ C of elements of C such that each Ci contains exactly two elements of P and each element of P...
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristan, ...
We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex vertices...
Hamiltonicity and Colorings of Arrangement Graphs (2007)
Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
We study connectivity, Hamilton path and Hamilton cycle decomposition, 4-edge and 3-vertex coloring for geometric graphs arising from pseudoline (affine or projective) and pseudocircle (spherical)...
Prunning Can Solve From Facility Location to Visibility Problems (2007)
Ferran Hurtado, Vera Sacristán, Godfried Toussaint
We present several results concerning minimax facility location, geometric problems with convex polygons defined by intersection of halfplanes, and optimization visibility problems, both in two and...
Hamiltonicity and Colorings of Geometric Graphs (2007)
Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
We study connectivity, Hamilton path and Hamilton cycle decomposition, 4-edge and 3-vertex coloring for geometric graphs arising from pseudoline (aÆne or projective) and pseudocircle (spherical)...
Chromatic Variants of the Erds-Szekeres Theorem on Points in Convex Position (2007)
Olivier Devillers, Ferran Hurtado, Carlos Seara, Thme Gnie Logiciel, Projets Prisme
apport de recherche
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...
Some Problems on Approximation of Set of Points by Polygonal Curves (2007)
J. Miguel D'iaz, Ferran Hurtado
Several fundamental problems in Computational Geometry come from the field of Facility Location. In this paper we consider some problems that belong to the interplay between these two areas. Given a...
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,...
Playing with Triangulations (2007)
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking...
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
9 1
Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, ...
9 1
Upper and Lower Bounds for Strictly Convex Quadrilateral Meshes of Point Sets (2007)
David Bremner, Ferran Hurtado, Suneeta Ramaswami
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 show that 3b n 2 c...
Oswin Aichholzer, Erik D. Demaine, Je Erickson, Ferran Hurtado, Mark Overmars, Michael Soss, ...
We prove that there is a motion from any convex polygon to any convex polygon with the same counterclockwise sequence of edge lengths, that preserves the lengths of the edges, and keeps the polygon...
Point-sets with few k-sets Helmut Alt (2007)
Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
A k-set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line. The question of how many k-sets a set of n points can contain is...
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristan, ...
We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex vertices...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
We show that the number of straight line triangulations exhibited by any set of n points in general position in the plane is bounded from below by 45 + ") n) for some "> 0. To...
On Local Transformations in Plane GeometricGraphs Embedded on Small Grids (Extended Abstract) (2007)
Extended Abstract, Prosenjit Bose, Manuel Abellanas, Alfredo Garcia, Pedro Ramos, Ferran Hurtado, ...
Manuel Abellanas , Prosenjit Bose , Alfredo Garca , Ferran Hurtado , Pedro Ramos , Eduardo Rivera-Campo , and Javier Tejel Facultad de Informatica, U. Politecnica de Madrid, Madrid, Spain School of...
Towards Compatible Triangulations (2007)
Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
We state the following conjecture: any two planar n-point sets (that agree on the number of convex hull points) can be triangulated in a compatible manner, i.e., such that the resulting two planar...
Best Fitting Rectangles (2007)
Manuel Abellanas Ferran, Ferran Hurtado, Christian Icking, Lihong Ma, Belén Palop, Pedro A. Ramos
January 2003 1
A Lower Bound on the Number of Triangulations of Planar Point Sets (2007)
Oswin Aichholzer, Ferran Hurtado, Marc Noy
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by 4 :33 ).
Ferran Hurtado, Marc Noy, Aplicada Ii, Jorge Urrutia
this paper is to show that this is indeed the case
On Polyhedra Induced by Point Sets in Space (2007)
Ferran Hurtado, Godfried T. Toussaint, Joan Trias
Given a set S of n 3 points in the plane (not all on a line) it is well known that it is always possible to polygonize S, i.e., construct a simple polygon P such that the vertices of P are precisely...
Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, Carlos Seara, Carlos Seara, ...
apport de recherche
Geodesic Ham-Sandwich Cuts (2007)
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, ...
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m+r+b. A ham-sandwich geodesic is a shortest path in P...
A polynomial bound for untangling geometric planar graphs (2007)
Bose, Prosenjit, Dujmovic, Vida, Hurtado, Ferran, Langerman, Stefan, Morin, Pat, Wood, David R.
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex...
Compatible Geometric Matchings (2007)
Aichholzer, Oswin, Bereg, Sergey, Dumitrescu, Adrian, García, Alfredo, Huemer, Clemens, Hurtado, Ferran, ...
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result...
Compatible Geometric Matchings (2007)
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, ...
Abstract: This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our first...
A polynomial bound for untangling geometric planar graphs (2007)
Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
ABSTRACT. To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every...
Axis-aligned traversals of points with a minimum number of turns (2007)
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
Abstract Given a finite set of points S in Rd, consider visiting the points in S with a polygonal path whichmakes a minimum number of turns, or equivalently, has the the minimum number of segments...
Partitions of complete geometric graphs into plane trees (2006)
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-campo, David R. Wood
Consider the open problem: does every complete geometric graph K 2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the...
On the number of plane graphs (2006)
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane graphs is minimized when S is in convex position,...
Partitions of complete geometric graphs into plane trees (2006)
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-campo, Iztapalapa México, David R. Wood
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study...
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, B. Vogtenhuber, ...
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane geometric graphs and connected plane geometric...
Voronoi Diagram and Related Problems (2006)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
team was supported by DAAD grant 314-AI-e-dr.
Partitions of complete geometric graphs into plane trees (2006)
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-campo, David R. Wood, Politècnica De Catalunya
Consider the open problem: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the...
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment (2005)
Colannino, Justin, Damian, Mirela, Hurtado, Ferran, Iacono, John, Meijer, Henk, Ramaswami, Suneeta, ...
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 one point in T, and...
Point set stratification and Delaunay depth (2005)
Abellanas, Manuel, Claverol, Mercè, Hurtado, Ferran
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 function, which is...
Matching points with geometric objects: Combinatorial results (2005)
Bernardo M. Ábrego, Esther Arkin, Silvia Fernández-merchant, Ferran Hurtado, Mikio Kano, ...
Abstract. Given a class C of geometric objects and a point set P,aCmatching of P is a set M = {C1,...,Ck} of elements of C such that every Ci contains exactly two elements of P. If all the elements...
Matching points with geometric objects: Combinatorial results (2005)
Bernardo Ábrego, Esther Arkin, Silvia Fernández, Ferran Hurtado, Mikio Kano, ...
Abstract. Given a class C of geometric objects and a point set P,aCmatching of P is a set M = {C1,...,Ck} of elements of C such that every Ci contains exactly two elements of P. If all the elements...
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...
Encompassing colored crossing-free geometric graphs (2004)
Ferran Hurtado, Mikio Kano, Csaba D. Tóth
Given n red and n blue points in the plane and a planar straight line matching between the red and the blue points, the matching can be extended into a bipartite planar straight line spanning tree....
Separating point sets in polygonal environments (2004)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, ...
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the interior of a polygon, we...
Geodesic ham-sandwich cuts (2004)
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
ABSTRACT. Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is a shortest...
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...
On local transformations in plane geometric graphs embedded on small grids (2004)
Manuel Abellanas, Prosenjit Bose, Alfredo García, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-campo, ...
Given two n-vertex plane graphs G1 = (V1, E1) and G2 = (V2, E2) with |E1 | = |E2 | embedded in the n × n grid, with straight-line segments as edges, we show that with a sequence of O(n) point moves...
Separating point sets in polygonal environments (2004)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, ...
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the interior of a polygon, we...
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, Javier Tejel
Abstract. 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...
Geodesic ham-sandwich cuts (2004)
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
ABSTRACT. Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is a shortest...
Geodesic ham-sandwich cuts (2004)
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
ABSTRACT. Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is a shortest...
Geodesic ham-sandwich cuts (2004)
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
ABSTRACT. Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is a shortest...
Separating point sets in polygonal environments (2004)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, ...
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the interior of a polygon, we...
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, Javier Tejel
Abstract. 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...
On the reflexivity of point sets (2003)
Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristán, ...
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 ρ(S) ofS is given by the smallest number of reflex...
On the reflexivity of point sets (2003)
S Andor, P. Fekete, Esther M. Arkin, Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, ...
x We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2003)
Olivier Devillers, Regina Estkowski, Ferran Hurtado, Pedro Ramos, Pierre-Marie Gandoin, Vera Sacristán
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2003)
Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos, Vera Sacristán
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay...
Optimal and Suboptimal Robust Algorithms for Proximity Graphs (2003)
Ferran Hurtado, Giuseppe Liotta, Henk Meijer
Given a set of n points in the plane, any fi-skeleton and [fl 0 ; fl 1 ]-graph can be computed in quadratic time. The presented algorithms are optimal for fi values that are less than 1 and [fl 0 ;...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Devillers, Olivier, Hurtado, Ferran, Károlyi, Gyula, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Devillers, Olivier, Hurtado, Ferran, Károlyi, Gyula, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Red-blue separability problems in 3d (2003)
Ferran Hurtado, Carlos Seara, Saurabh Sethia
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane. 1
Chromatic variants of the Erdös-Szekeres Theorem (2003)
Olivier Devillers, Ferran Hurtado, Carlos Seara
submitted to CGTA Abstract Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems...
On the reflexivity of point sets (2003)
Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Marc Noy, Vera Sacristán, ...
Abstract. We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity ρ(S) ofS is given by the smallest number of...
On the Reflexivity of Point Sets (2002)
Arkin, Esther M., Fekete, Sandor P., Hurtado, Ferran, Mitchell, Joseph S. B., Noy, Marc, Sacristan, Vera, ...
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 number of reflex...
Small Strictly Convex Quadrilateral Meshes of Point Sets (2002)
Bremner, David, Hurtado, Ferran, Ramaswami, Suneeta, Sacristan, Vera
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 show that...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
On local transformation of polygons with visibility properties (2002)
Carmen Hernando, Michael E. Houle, Ferran Hurtado
One strategy for the enumeration of a class of objects is local transformation, in which new objects of the class are produced by means of a small modication of a previously-visited object in the...
The weighted farthest color Voronoi diagram on trees and graphs (2002)
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexity, and provide...
The weighted farthest color Voronoi diagram on trees and graphs (Extended Abstract) (2002)
Ferran Hurtado, Vera Sacristan, Rolf Klein, Elmar Langetepe
Ferran Hurtado, Vera Sacrist an Dept. de Matem atica Aplicada II Univ. Polit ecnica de Catalunya, Barcelona, Spain Rolf Klein, Elmar Langetepe Institut f ur Informatik I Universit at Bonn, Germany...
Ferran Hurtado, Rolf Klein, Elmar Langetepe
The weighted farthest color Voronoi diagram on trees and graphs
The weighted farthest color Voronoi diagram on trees and graphs (2002)
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexity, and provide...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2001)
Devillers, Olivier, Estkowski, Regina, Gandoin, Pierre-Marie, Hurtado, Ferran, Ramos, Pedro, Sacristán, Vera
Given a triangulation $T$ of $n$ points in the plane, we are interested in the minimal set of edges in $T$ such that $T$ can be reconstructed from this set (and the vertices of $T$) using constrained...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2001)
Devillers, Olivier, Estkowski, Regina, Gandoin, Pierre-Marie, Hurtado, Ferran, Ramos, Pedro, Sacristán, Vera
Given a triangulation $T$ of $n$ points in the plane, we are interested in the minimal set of edges in $T$ such that $T$ can be reconstructed from this set (and the vertices of $T$) using constrained...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2001)
Devillers, Olivier, Estkowski, Regina, Gandoin, Pierre-Marie, Hurtado, Ferran, Ramos, Pedro, Sacristán, Vera
Given a triangulation $T$ of $n$ points in the plane, we are interested in the minimal set of edges in $T$ such that $T$ can be reconstructed from this set (and the vertices of $T$) using constrained...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Merce, Sacristan, Vera, Teillaud, Monique
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can...
Francisco Gómez, Ferran Hurtado
Abstract. Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation has been...
Separating several point sets in the plane (2001)
Olivier Devillers, Ferran Hurtado, Carlos Seara
In this paper we study some problems on the separability of k disjoint point sets in the plane. On one hand, we give algorithms for nding minimum-cardinality separators by means of parallel lines or...
The farthest color Voronoi diagram and related problems (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
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...
Smallest color-spanning objects (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
Motivated by questions in location planning, we show for a set of colored points in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and...
The farthest color Voronoi diagram and related problems (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
Suppose there are k types of facilities, e. g. schools, post o#ces, supermarkets, modeled by n colored points in the plane, each type by its own color. One basic goal in choosing a residence location...
Smallest color-spanning objects (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and...
Splitting a Delaunay Triangulation in Linear Time (2001)
Bernard Chazelle, Bernard Chazelle, Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, ...
Computing the Delaunay triangulation of n points requires usually a minimum of# n log n# operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Splitting a Delaunay Triangulation in Linear Time (2001)
Vera Sacristn, Unit Inria, Sophia Antipolis, Bernard Chazelle, Bernard Chazelle, Olivier Devillers, ...
Computing the Delaunay triangulation of n points requires usually a minimum of n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2001)
Ferran Hurtado, Vera Sacristn, Unit Inria, Sophia Antipolis, Olivier Devillers, Olivier Devillers, ...
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay...
Some lower bounds on geometric separability problems (2001)
Esther M. Arkin, Ferran Hurtado, Carlos Seara, Steven S. Skiena
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show Ω(n log n) time lower bounds for separability by...
Smallest color-spanning objects (2001)
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, ...
Abstract. Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and the...
Some lower bounds on geometric separability problems (2001)
Esther M. Arkin, Ferran Hurtado, Carlos Seara, Steven S. Skiena
In this paper we obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. More precisely, we show Ω(n log n) time lower bounds for the...
Constrained facility location (2000)
Ferran Hurtado, Godfried Toussaint
In a classical facility location problem we are given a set of n points C in the plane representing n customers, plants to be serviced, schools, markets, distribution
Hamiltonicity and colorings of arrangement graphs (2000)
Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
We study connectivity, Hamilton path and Hamilton cycle decomposition, 4-edge and 3-vertex coloring for geometric graphs arising from pseudoline (ane or projective) and pseudocircle (spherical)...
Reconfiguring Convex Polygons (2000)
Oswin Aichholzer Erik, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael A. Soss, ...
. We prove that there is a motion from any convex polygon to any convex polygon with the same counterclockwise sequence of edge lengths, that preserves the lengths of the edges, and keeps the polygon...
Implicit Convex Polygons (2000)
Francisco Gomez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán, Godfried Toussaint
Convex polygons in the plane can be de ned explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation has been considered...
Reconfiguring Convex Polygons (2000)
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael A. Soss, ...
. We prove that there is a motion from any convex polygon to any convex polygon with the same counterclockwise sequence of edge lengths, that preserves the lengths of the edges, and keeps the polygon...
Implicit Convex Polygons (2000)
Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán, Godfried Toussaint
this paper we study the case, that appears to be very natural, in which the polygons are given by a set of linear restrictions, i.e. by a possibly redundant intersection of halfplanes. There is not...
Constrained Facility Location (2000)
Ferran Hurtado, Vera Sacristán, Godfried Toussaint
In this paper we consider constrained versions of the minimax facility location problem. We provide an O(n +m) time algorithm for the problem of constructing the minimum enclosing circle of a set of...
Hamiltonicity and Colorings of (2000)
Arrangement Graphs Stefan, Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
We study connectivity, Hamilton path and Hamilton cycle decomposition, 4-edge and 3-vertex coloring for geometric graphs arising from pseudoline (ane or projective) and pseudocircle (spherical)...
Some constrained minimax and maximin location problems (2000)
Ferran Hurtado, Vera Sacristan, Departament Matematica, Aplicada Ii, Godfried Toussaint
In this paper we consider constrained versions of the Euclidean minimax facility location problem. We provide an O(n+m) time algorithm for the problem of constructing the minimum enclosing circle of...
Properties of random triangulations and trees (1999)
Luc Devroye, Inria Rocquencourt, Ferran Hurtado, Marc Noy, William Steiger
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric " features of a triangulation # Tn, for example...
Random Triangulations and Trees (1999)
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William Steiger, Politecnica Catalunya, ...
gulation ø of K, let d i denote the degree of vertex v i , the number of (the n \Gamma 3 internal) diagonals of ø that are incident with v i . We study \Delta n (ø) = max(d i ; i = 0; : : : ; n...
Properties of random triangulations and trees (1999)
Luc Devroye, Marc Noy, Ferran Hurtado, William Steiger
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural “geometric ” features of a triangulation τ ∈ Tn, for example ∆n(τ)...
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...
Illuminating Objects with Mirrors (1998)
Ferran Hurtado, Marc Noy, Jean-Marc Robert, Vera Sacristán, Steven Skiena
Advanced computer graphics techniques such as ray tracing... In this paper, we provide algorithms and geometries providing optimal mirror placements for two natural classes of problems;...
Perspective Projections and Removal of Degeneracies (1998)
Francisco Gomez, Ferran Hurtado, Toni Sellares, Godfried Toussaint
In this paper we consider the following problems: (1) computing projections with distinct x-coordinates, (2) computing non-collinear projections, (3) computing noncocircular projections, and (4)...
Unoriented Theta-Maxima In The Plane: Complexity And Algorithms (1998)
David Avis, Bryan Beresford-smith, Luc Devroye, Hossam Elgindy, Eric Guévremont, Ferran Hurtado, ...
We introduce the unoriented Theta-maximum as a new criterion for describing the shape of a set of planar points. We present efficient algorithms for computing the unoriented Theta-maximum of a set of...
Point-Sets With Few K-Sets (1998)
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
A k-set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line. The question of how many k-sets a set of n points can contain is...
Random Triangulations (Extended Abstract) (1996)
Luc Devroye, Philippe Flajolet, Inria Rocquencourt, Ferran Hurtado, Marc Noy, William Steiger
) 3 Luc Devroye McGill University luc@kriek.cs.mcgill.ca Philippe Flajolet INRIA - Rocquencourt Philippe.Flajolet@inria.fr Ferran Hurtado Universitat Politecnica de Catalunya hurtado@ma2.upc.es Marc...
Illuminating Objects with Mirrors (1996)
Ferran Hurtado, Marc Noy, Jean-Marc Robert, Vera Sacristán, Steven Skiena
Advanced computer graphics techniques such as ray tracing are being used to visualize complicated...
Incidence Angle Constrained Visibility (1996)
Gregoria Blanco, Jesus Garcia Lopez, Ferran Hurtado, Pedro Ramos, Vera Sacristan
We present the first part of a study on what we call quality pictures, where we introduce a quality parameter ff that indicates the minimum incidence angle allowed between the vision direction and a...
Incidence Angle Constrained Visibility (1996)
Gregoria Blanco, Ferran Hurtado, Pedro Ramos, Vera Sacristan
We present the rst part of a study on what we call quality pictures, where weintroduce a quality parameter that indicates the minimum incidence angle allowed between the vision direction and a seen...
Redrawing a Graph within a Geometric Tolerance (1995)
Abellanas, Manuel, Hurtado, Ferran, Ramos, Pedro
In this paper we investigate some applications of the concept of tolerance to graph drawing. Given a geometric structure, the tolerance is a measure of how much the set of points can be arbitrarily...
Redrawing a Graph within a Geometric Tolerance (1995)
Abellanas, Manuel, Hurtado, Ferran, Ramos, Pedro
In this paper we investigate some applications of the concept of tolerance to graph drawing. Given a geometric structure, the tolerance is a measure of how much the set of points can be arbitrarily...
Redrawing a Graph within a Geometric Tolerance (1995)
Abellanas, Manuel, Hurtado, Ferran, Ramos, Pedro
In this paper we investigate some applications of the concept of tolerance to graph drawing. Given a geometric structure, the tolerance is a measure of how much the set of points can be arbitrarily...
Gregoria Blanco, Ferran Hurtado, Jesus Garcia Lopez, Pedro Ramos, Vera Sacristan
We present the first part of a study on what we call quality pictures, where we introduce a quality parameter ff that indicates the minimum incidence angle allowed between the vision direction and a...