Ferran Hurtado | Academic Influence

Ferran Hurtado's AcademicInfluence.com Rankings

Ferran Hurtado

Mathematics

#7204

World Rank

#9836

Historical Rank

Graph Theory

#113

World Rank

#121

Historical Rank

Measure Theory

#3840

World Rank

#4528

Historical Rank

mathematics Degrees

Ferran Hurtado

Computer Science

#10111

World Rank

#10605

Historical Rank

Theoretical Computer Science

#145

World Rank

#145

Historical Rank

Database

#9053

World Rank

#9517

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Ferran Hurtado's Degrees

PhD Mathematics Polytechnic University of Catalonia
PhD Computer Science Polytechnic University of Catalonia

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Ferran Hurtado Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ferran Hurtado Díaz was a Spanish mathematician and computer scientist known for his research in computational geometry. Life Hurtado was born on 8 May 1951 in Valencia, Spain. He earned his Ph.D. degree from the Polytechnic University of Catalonia in Barcelona in 1993 under the supervision of Oriol Serra Albó; his dissertation was Problemas geométricos de visibilidad [Geometric problems of visibility]. It won the Premio Extraordinario de Doctorado UPC in 1995.

(See a Problem?)

Ferran Hurtado's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Flipping Edges in Triangulations (1996) (188)
Flips in planar graphs (2009) (113)
Graph of triangulations of a convex polygon and tree of triangulations (1999) (95)
Necklaces, Convolutions, and X+Y (2006) (73)
On the Number of Plane Geometric Graphs (2007) (62)
A lower bound on the number of triangulations of planar point sets (2004) (57)
The Farthest Color Voronoi Diagram and Related Problems (2001) (56)
Smallest Color-Spanning Objects (2001) (54)
Compatible geometric matchings (2007) (48)
Structural Tolerance and Delaunay Triangulation (1999) (46)
Augmenting the connectivity of geometric graphs (2008) (45)
Separating objects in the plane by wedges and strips (2001) (43)
Sequences of spanning trees and a fixed tree theorem (2002) (42)
Simultaneous Edge Flipping in Triangulations (2003) (41)
Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position (2003) (41)
Voronoi Diagram for services neighboring a highway (2003) (39)
Edge-Removal and Non-Crossing Configurations in Geometric Graphs (2010) (39)
Token Graphs (2009) (38)
Splitting a Delaunay Triangulation in Linear Time (2001) (37)
Plane Geometric Graph Augmentation: A Generic Perspective (2013) (37)
Graphs of Non-Crossing Perfect Matchings (2002) (37)
Geometric Tree Graphs of Points in Convex Position (1999) (35)
On the Reflexivity of Point Sets (2001) (34)
Counting triangulations of almost-convex polygons (1997) (33)
Graphs of Triangulations and Perfect Matchings (2005) (33)
Properties of Random Triangulations and Trees (1999) (32)
The Largest Empty Annulus Problem (2002) (31)
Partitions of Complete Geometric Graphs into Plane Trees (2004) (31)
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs (2009) (31)
On the chromatic number of some geometric type Kneser graphs (2005) (31)
Distributed reconfiguration of 2D lattice-based modular robotic systems (2015) (29)
Packing trees into planar graphs (1997) (28)
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons (2009) (28)
Traversing a Set of Points with a Minimum Number of Turns (2007) (28)
Geodesic Ham-Sandwich Cuts (2004) (27)
On the number of plane graphs (2006) (27)
Non-crossing matchings of points with geometric objects (2013) (27)
Efficient Many-To-Many Point Matching in One Dimension (2007) (27)
Reconfiguring convex polygons (2001) (27)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms (1999) (26)
Edge Operations on Non-Crossing Spanning Trees (2000) (26)
Bichromatic 2-center of pairs of points (2012) (25)
Witness (Delaunay) graphs (2010) (25)
Hamiltonicity and colorings of arrangement graphs (2000) (24)
Encompassing colored planar straight line graphs (2008) (24)
Matching Points with Squares (2009) (24)
Some Lower Bounds on Geometric Separability Problems (2006) (24)
On a Visibility Representation of Graphs (1995) (24)
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem (2005) (24)
Moving coins (2006) (23)
Separating point sets in polygonal environments (2004) (23)
Colored Spanning Graphs for Set Visualization (2013) (23)
On local transformation of polygons with visibility properties (2000) (23)
Witness Gabriel graphs (2010) (23)
On properties of higher-order Delaunay graphs with applications (2005) (23)
Packing Convex Polygons into Rectangular Boxes (2000) (23)
Towards compatible triangulations (2001) (23)
Balanced partitions of 3-colored geometric sets in the plane (2015) (21)
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009) (20)
Small weak epsilon nets (2009) (19)
Some Constrained Minimax and Maximin Location Problems (2000) (19)
Ears of triangulations and Catalan numbers (1996) (19)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Terrain visibility with multiple viewpoints (2013) (18)
Convexifying Polygons Without Losing Visibilities (2011) (18)
Some Aperture-Angle Optimization Problems (2002) (18)
Coloring and Guarding Arrangements (2012) (17)
Approximation of Point Sets by 1-Corner Polygonal Chains (2000) (16)
The graph of triangulations of a convex polygon (1996) (16)
Best Fitting Rectangles (2004) (15)
On Flips in Polyhedral Surfaces (2002) (15)
Matching Points with Circles and Squares (2004) (15)
On k-convex polygons (2010) (15)
On triconnected and cubic plane graphs on given point sets (2009) (15)
Some properties of k-Delaunay and k-Gabriel graphs (2013) (14)
On the Chromatic Number of some Flip Graphs (2009) (14)
Encompassing colored crossing-free geometric graphs (2004) (14)
Optimal location of transportation devices (2008) (14)
Gray codes for non-crossing partitions and dissections of a convex polygon (2009) (13)
Separating several point sets in the plane (2001) (13)
Separability by two lines and by nearly straight polygonal chains (2004) (13)
The weighted farthest color Voronoi diagram on trees and graphs (2004) (13)
Computing obnoxious 1-corner polygonal chains (2006) (13)
Measuring regularity of convex polygons (2013) (13)
Small Convex Quadrangulations of Point Sets (2001) (13)
Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon (1996) (13)
Stabbing Information of a Simple Polygon (1996) (12)
Witness Rectangle Graphs (2011) (11)
Optimal and suboptimal robust algorithms for proximity graphs (2003) (11)
Nice Perspective Projections (2001) (11)
Small Strictly Convex Quadrilateral Meshes of Point Sets (2002) (11)
Matching Edges and Faces in Polygonal Partitions (2008) (11)
On crossing numbers of geometric proximity graphs (2011) (11)
Highway hull revisited (2008) (11)
On k-Enclosing Objects in a Coloured Point Set (2013) (11)
On the equipartition of plane convex bodies and convex polygons (2005) (10)
Tolerance of Geometric Structures (1994) (10)
On Polyhedra Induced by Point Sets in Space (2003) (10)
Point set stratification and Delaunay depth (2005) (10)
Augmenting the Connectivity of Outerplanar Graphs (2010) (10)
Looking through a Window (1993) (10)
Games on triangulations (2005) (9)
Red-blue separability problems in 3D (2003) (9)
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction (2003) (9)
Vertex Pops and Popturns (2007) (9)
Draining a Polygon - or - Rolling a Ball out of a Polygon (2014) (8)
Compatible spanning trees (2014) (8)
Geometric Biplane Graphs II: Graph Augmentation (2015) (8)
On Polygons Enclosing Point Sets II (2009) (8)
On the number of triangulations every planar point set must have (2001) (8)
Universal Point Subsets for Planar Graphs (2012) (8)
Some Separability Problems in the Plane (2000) (8)
Hiding points in arrangements of segments (1996) (8)
Proceedings of the twenty-seventh annual symposium on Computational geometry (2011) (8)
Geometric Biplane Graphs I: Maximal Graphs (2015) (7)
Parallel edge flipping (1998) (7)
The Heavy Luggage Metric (2008) (7)
A Lower Bound on the Area of a 3-Coloured Disc Packing (2008) (7)
Moving Walkways, Escalators, and Elevators (2007) (6)
Onion Polygonizations (1996) (6)
Matching Points with Things (2010) (6)
Connectivity-preserving transformations of binary images (2009) (6)
Blocking the $$k$$k-Holes of Point Sets in the Plane (2015) (6)
On polygons enclosing point sets (1992) (6)
Some problems on approximation of set of points by polygonal curves (1998) (6)
Updating Polygonizations * (1993) (6)
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids (2004) (6)
Proximity graphs inside large weighted graphs (2013) (5)
On a Triangle with the Maximum Area in a Planar Point Set (2003) (5)
Some properties of higher order delaunay and gabriel graphs (2010) (5)
A generalized Winternitz Theorem (2011) (4)
On k-convex point sets (2014) (4)
Transforming triangulations of polygons on non planar surfaces (2003) (4)
Distributed universal reconfiguration of 2D lattice-based modular robots (2013) (4)
Point-sets with few k-sets (1998) (4)
Two Problems on Separability With Lines and Polygonals (1999) (4)
A Problem on Hinged Dissections with Colours (2004) (4)
On Degeneracies Removable by Perspective Projections (4)
On embedding triconnected cubic graphs on point sets (2007) (4)
Centerpoint Theorems for Wedges (2009) (4)
A class of point-sets with few k-sets (2000) (4)
On the Equipartitions of Convex Bodies and Convex Polygons (2000) (3)
Perspective projections and removal of degeneracies (1998) (3)
Transforming Triangulations on Nonplanar Surfaces (2003) (3)
Matching points with geometric objects : Combinatorial results (2004) (3)
Distance 2-Domination in Prisms of Graphs (2017) (3)
Aperture angle optimization problems (1995) (3)
Compatible matchings for bichromatic plane straight-line graphs (2012) (3)
Proximity Drawings of High-Degree Trees (2010) (3)
Proceedings of the eighteenth annual symposium on Computational geometry (2002) (2)
Stabbing Simplices of Point Sets with k-flats (2014) (2)
Coverage restricted to an angle (2011) (2)
On the minimum size of visibility graphs (2002) (2)
Optimal Point Set Projections onto Regular Grids (2003) (2)
Finding Specified Sections of Arrangements: 2D Results (2002) (2)
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane (2014) (2)
Redrawing a Graph within a Geometric Tolerance (1994) (2)
Circumscribed Polygons of Small Area (2009) (2)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
On the number of visibility graphs of simple polygons (2001) (2)
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs (2001) (2)
Implicit Convex Polygons (2002) (2)
Consecutive Guards (1994) (2)
Separability by two lines and by flat polygonals (2002) (2)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2014) (1)
On the number of non-crossing rays configurations (2007) (1)
LARGE BICHROMATIC POINT SETS ADMIT EMPTY (2009) (1)
Bounding the Number of Plane Graphs (2005) (1)
M G ] 2 1 M ay 2 01 0 TRANSFORMING TRIANGULATIONS ON NON-PLANAR SURFACES (2010) (1)
Geometric Biplane Graphs II: Graph Augmentation (2015) (1)
Voronoi Diagram and Related Problems (2006) (1)
Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd (2018) (1)
Good Illumination of Minimum Range (2006) (1)
Mexican Conference on Discrete Mathematics and Computational Geometry Geometric Biplane Graphs I : Maximal Graphs ∗ (2014) (1)
Visualizing Objects with Mirrors (2004) (1)
Optimal projections onto grids and finite resolution images (2005) (1)
Configurations of Non-crossing Rays and Related Problems (2016) (1)
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment (2005) (1)
Random Triangulations ( Extended Abstract ) (1996) (1)
Mutual witness proximity graphs (2014) (1)
Some Regularity Measures for Convex Polygons (2009) (1)
Computational geometry : XIV Spanish meeting, EGC 2011 dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27-30, 2011, revised selected papers (2012) (1)
Necklaces, Convolutions, and X+Y (2012) (0)
Hamiltoni ity and Colorings ofArrangement (2000) (0)
Geometric tree graphs of points in the plane (1998) (0)
Computational Geometry: Theory and Applications (2011) (0)
A General Approximation Algorithm for Planar Maps with Applications (2007) (0)
The rotation graph of k (2008) (0)
Games on Triangulations [ Dagstuhl version ] (0)
On Some Generalizations of Delaunay Graphs (2009) (0)
Improving Shortest Paths in the Delaunay Triangulation (2012) (0)
The Rotation Graph of kary Trees is Hamiltonian ∗ (2006) (0)
On a Visibil ity Representat ion of Graphs (2005) (0)
Mexican Conference on Discrete Mathematics and Computational Geometry Witness-Bar Visibility Graphs (2013) (0)
On Contractible Edges in Convex Decompositions (2017) (0)
Illuminating Objects with Mirrors ( Long Version ) (1996) (0)
Blocking thek-holes of point sets on the plane (2011) (0)
Compatible Trees ∗ (2012) (0)
Upper and Lower Bounds for Stri tly Convex Quadrilateral Meshes of Point Sets (2001) (0)
On Crossings in Geometric Proximity Graphs (2009) (0)
Simultaneous edge ipping in triangulationsJ (2003) (0)
Token Graphs (2011) (0)
Finding Speci(cid:12)ed Sections of Arrangements: 2D Results (2022) (0)
Guest Editors’ Foreword (2013) (0)
Constrainted facility location (1998) (0)
Incidence Angle Constrained Visibility (1996) (0)
Open Problems from Cccg 2002 Kissing Circle Representation (2002) (0)
Quality Pictures (1995) (0)
Alternating paths ∗ (2004) (0)
Optimal Projections onto Grids [ Extended Abstract ] (2002) (0)
Necklaces , Convolutions , and X + Y Citation (2012) (0)
Configurations of Non-crossing Rays and Related Problems (2016) (0)
Order types and cross-sections of line arrangements in R^3 (2014) (0)
Hamiltoni ity and Colorings of Geometri Graphs (2007) (0)
Colored Ray Configurations (2018) (0)
Foreword (2001) (0)
Playing with Triangulations (2002) (0)
D ec 2 01 2 Necklaces , Convolutions , and X + (2014) (0)
C G ] 2 O ct 2 00 2 On the Reflexivity of Point Sets (2008) (0)
Witness Rectangle Graphs (2013) (0)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2013) (0)
Towards Compatible TriangulationsOswin (2007) (0)
Geometric Biplane Graphs I: Maximal Graphs (2015) (0)
On Lo al Transformation of Polygons withVisibility Properties (2002) (0)

This paper list is powered by the following services:

Other Resources About Ferran Hurtado

en.wikipedia.org

What Schools Are Affiliated With Ferran Hurtado?

Ferran Hurtado is affiliated with the following schools:

Polytechnic University of Catalonia