Ferran Hurtado

According to our database1, Ferran Hurtado authored at least 178 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Cross-sections of line configurations in R3 and (<i>d</i> - 2)-flat configurations in Rd.
Comput. Geom., 2019

2018
Colored ray configurations.
Comput. Geom., 2018

Colored spanning graphs for set visualization.
Comput. Geom., 2018

Pachinko.
Comput. Geom., 2018

2017
On Contractible Edges in Convex Decompositions.
J. Inf. Process., 2017

Distance 2-domination in prisms of graphs.
Discuss. Math. Graph Theory, 2017

2016
Configurations of Non-crossing Rays and Related Problems.
Discret. Comput. Geom., 2016

2015
Geometric Biplane Graphs II: Graph Augmentation.
Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs Comb., 2015

Blocking the k-Holes of Point Sets in the Plane.
Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.
Discret. Appl. Math., 2015

Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

Distributed reconfiguration of 2D lattice-based modular robotic systems.
Auton. Robots, 2015

2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

Mutual witness proximity graphs.
Inf. Process. Lett., 2014

Terrain Visibility with Multiple Viewpoints.
Int. J. Comput. Geom. Appl., 2014

Stabbing Simplices of Point Sets with <i>k</i>-flats.
Int. J. Comput. Geom. Appl., 2014

Witness Rectangle Graphs.
Graphs Comb., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci., 2014

Compatible spanning trees.
Comput. Geom., 2014

Draining a polygon - or - rolling a ball out of a polygon.
Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.
Algorithmica, 2014

Order types and cross-sections of line arrangements in R^3.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

Proximity Drawings of High-Degree Trees.
Int. J. Comput. Geom. Appl., 2013

Coloring and Guarding Arrangements.
Discret. Math. Theor. Comput. Sci., 2013

Guest Editors' foreword.
Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Witness Gabriel graphs.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Measuring regularity of convex polygons.
Comput. Aided Des., 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

On k-Enclosing Objects in a Coloured Point Set.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

Improving Shortest Paths in the Delaunay Triangulation.
Int. J. Comput. Geom. Appl., 2012

Token Graphs.
Graphs Comb., 2012

On k-convex polygons.
Comput. Geom., 2012

Universal Point Subsets for Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Coverage restricted to an angle.
Oper. Res. Lett., 2011

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 2011

Witness (Delaunay) graphs.
Comput. Geom., 2011

On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Transforming Triangulations on Nonplanar Surfaces.
SIAM J. Discret. Math., 2010

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.
SIAM J. Discret. Math., 2010

A Lower Bound on the Area of a 3-Coloured Disk Packing.
Int. J. Comput. Geom. Appl., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010

Highway hull revisited.
Comput. Geom., 2010

Augmenting the Connectivity of Outerplanar Graphs.
Algorithmica, 2010


Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs.
Int. J. Comput. Geom. Appl., 2009

On Polygons Enclosing Point Sets II.
Graphs Comb., 2009

On the Chromatic Number of some Flip Graphs.
Discret. Math. Theor. Comput. Sci., 2009

Centerpoint Theorems for Wedges.
Discret. Math. Theor. Comput. Sci., 2009

Traversing a Set of Points with a Minimum Number of Turns.
Discret. Comput. Geom., 2009

Matching Points with Squares.
Discret. Comput. Geom., 2009

Gray codes for non-crossing partitions and dissections of a convex polygon.
Discret. Appl. Math., 2009

Connectivity-preserving transformations of binary images.
Comput. Vis. Image Underst., 2009

On triconnected and cubic plane graphs on given point sets.
Comput. Geom., 2009

Flips in planar graphs.
Comput. Geom., 2009

Small weak epsilon-nets.
Comput. Geom., 2009

2008
The rotation graph of k.
Inf. Process. Lett., 2008

The Heavy Luggage Metric.
Int. J. Comput. Geom. Appl., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

On polyhedra induced by point sets in space.
Discret. Appl. Math., 2008

Encompassing colored planar straight line graphs.
Comput. Geom., 2008

Optimal location of transportation devices.
Comput. Geom., 2008

Matching edges and faces in polygonal partitions.
Comput. Geom., 2008

Augmenting the connectivity of geometric graphs.
Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.
Comput. Geom., 2008

2007
A General Approximation Algorithm for Planar Maps with Applications.
Int. J. Comput. Geom. Appl., 2007

Efficient Many-To-Many Point Matching in One Dimension.
Graphs Comb., 2007

On the Number of Plane Geometric Graphs.
Graphs Comb., 2007

On embedding triconnected cubic graphs on point sets.
Electron. Notes Discret. Math., 2007

Geodesic Ham-Sandwich Cuts.
Discret. Comput. Geom., 2007

Point set stratification and Delaunay depth.
Comput. Stat. Data Anal., 2007

Moving Walkways, Escalators, and Elevators
CoRR, 2007

Editorial.
Comput. Geom., 2007

A Lower Bound on the Area of a 3-Coloured Disc Packing.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
An <i>O</i>(<i>n</i> log <i>n</i>)-Time Algorithm for the Restriction Scaffold Assignment Problem.
J. Comput. Biol., 2006

Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geom. Appl., 2006

Hamiltonicity and colorings of arrangement graphs.
Discret. Appl. Math., 2006

Good Illumination of Minimum Range
CoRR, 2006

Computing obnoxious 1-corner polygonal chains.
Comput. Oper. Res., 2006

Partitions of complete geometric graphs into plane trees.
Comput. Geom., 2006

Moving coins.
Comput. Geom., 2006

On the number of plane graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Squares.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Necklaces, Convolutions, and <i>X</i> + <i>Y</i>.
Proceedings of the Algorithms, 2006

2005
Games on triangulations.
Theor. Comput. Sci., 2005

Optimal projections onto grids and finite resolution images.
J. Vis. Commun. Image Represent., 2005

Red-blue separability problems in 3D.
Int. J. Comput. Geom. Appl., 2005

Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geom. Appl., 2005

Graphs of Triangulations and Perfect Matchings.
Graphs Comb., 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR, 2005

On the chromatic number of some geometric type Kneser graphs.
Comput. Geom., 2005

On properties of higher-order Delaunay graphs with applications.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
A Problem on Hinged Dissections with Colours.
Graphs Comb., 2004

Separability by two lines and by nearly straight polygonal chains.
Discret. Appl. Math., 2004

The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom., 2004

A lower bound on the number of triangulations of planar point sets.
Comput. Geom., 2004

Visualizing Objects with Mirrors.
Comput. Graph. Forum, 2004

Small Strictly Convex Quadrilateral Meshes of Point Sets.
Algorithmica, 2004

Matching Points with Circles and Squares.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Encompassing colored crossing-free geometric graphs.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Towards compatible triangulations.
Theor. Comput. Sci., 2003

Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett., 2003

Simultaneous Edge Flipping in Triangulations.
Int. J. Comput. Geom. Appl., 2003

The Largest Empty Annulus Problem.
Int. J. Comput. Geom. Appl., 2003

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction.
Int. J. Comput. Geom. Appl., 2003

Transforming triangulations of polygons on non planar surfaces
CoRR, 2003

Optimal and suboptimal robust algorithms for proximity graphs.
Comput. Geom., 2003

Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position.
Comput. Geom., 2003

On a Triangle with the Maximum Area in a Planar Point Set.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Optimal Point Set Projections onto Regular Grids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

On Polyhedra Induced by Point Sets in Space.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On local transformation of polygons with visibility properties.
Theor. Comput. Sci., 2002

Implicit Convex Polygons.
J. Math. Model. Algorithms, 2002

Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms, 2002

Packing trees into planar graphs.
J. Graph Theory, 2002

On the minimum size of visibility graphs.
Inf. Process. Lett., 2002

On Flips in Polyhedral Surfaces.
Int. J. Found. Comput. Sci., 2002

Graphs of Non-Crossing Perfect Matchings.
Graphs Comb., 2002

Sequences of spanning trees and a fixed tree theorem.
Comput. Geom., 2002

Splitting a Delaunay Triangulation in Linear Time.
Algorithmica, 2002

Some Aperture-Angle Optimization Problems.
Algorithmica, 2002

Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Nice Perspective Projections.
J. Vis. Commun. Image Represent., 2001

On the number of visibility graphs of simple polygons.
Discret. Math., 2001

Separating objects in the plane by wedges and strips.
Discret. Appl. Math., 2001

Foreword.
Discret. Appl. Math., 2001

Reconfiguring convex polygons.
Comput. Geom., 2001

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Small Convex Quadrangulations of Point Sets.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Smallest Color-Spanning Objects.
Proceedings of the Algorithms, 2001

Separating several point sets in the plane.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

On the number of triangulations every planar point set must have.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Approximation of Point Sets by 1-Corner Polygonal Chains.
INFORMS J. Comput., 2000

A class of point-sets with few k-sets.
Comput. Geom., 2000

Packing Convex Polygons into Rectangular Boxes.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Equipartitions of Convex Bodies and Convex Polygons.
EuroCG, 2000

Some Separability Problems in the Plane.
EuroCG, 2000

Edge Operations on Non-Crossing Spanning Trees.
EuroCG, 2000

1999
Structural Tolerance and Delaunay Triangulation.
Inf. Process. Lett., 1999

Flipping Edges in Triangulations.
Discret. Comput. Geom., 1999

Properties of Random Triangulations and Trees.
Discret. Comput. Geom., 1999

Geometric Tree Graphs of Points in Convex Position.
Discret. Appl. Math., 1999

Stabbing Information of a Simple Polygon.
Discret. Appl. Math., 1999

Graph of triangulations of a convex polygon and tree of triangulations.
Comput. Geom., 1999

1998
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.
SIAM J. Comput., 1998

Point-Sets with few <i>k</i>-Sets.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Constrainted facility location.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Parallel edge flipping.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Separating objects in the plane with wedges and strips.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Geometric tree graphs of points in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Perspective projections and removal of degeneracies.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Some problems on approximation of set of points by polygonal curves.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Counting triangulations of almost-convex polygons.
Ars Comb., 1997

1996
Onion Polygonizations.
Inf. Process. Lett., 1996

Hiding points in arrangements of segments.
Discret. Math., 1996

Ears of triangulations and Catalan numbers.
Discret. Math., 1996

Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon.
Comput. Geom., 1996

The Graph of Triangulations of a Convex Polygon.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
On a Visibility Representation of Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Aperture angle optimization problems.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Redrawing a Graph within a Geometric Tolerance.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Tolerance of Geometric Structures.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

Consecutive Guards.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Updating Polygonizations.
Comput. Graph. Forum, 1993

Looking through a Window.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993


  Loading...