Ferran Hurtado

From MaRDI portal
Person:170489

Available identifiers

zbMath Open hurtado.ferranWikidataQ55079125 ScholiaQ55079125MaRDI QIDQ170489

List of research outcomes

PublicationDate of PublicationType
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)2018-11-19Paper
Pachinko2018-02-19Paper
Colored spanning graphs for set visualization2018-02-19Paper
Colored ray configurations2018-02-19Paper
Geodesic ham-sandwich cuts2017-09-29Paper
Separating point sets in polygonal environments2017-09-29Paper
On contractible edges in convex decompositions2017-09-18Paper
Distance 2-domination in prisms of graphs2017-04-12Paper
Necklaces, convolutions, and \(X+Y\)2017-03-27Paper
Configurations of non-crossing rays and related problems2016-05-12Paper
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES2015-12-22Paper
Blocking the \(k\)-holes of point sets in the plane2015-09-24Paper
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS2015-07-01Paper
Geometric biplane graphs. I: Maximal graphs2015-05-22Paper
Geometric biplane graphs. II: Graph augmentation2015-05-22Paper
STABBING SIMPLICES OF POINT SETS WITH k-FLATS2015-04-22Paper
Bichromatic 2-center of pairs of points2015-03-06Paper
https://portal.mardi4nfdi.de/entity/Q51731632015-02-09Paper
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing2015-01-21Paper
Balanced partitions of 3-colored geometric sets in the plane2014-12-05Paper
Witness rectangle graphs2014-09-19Paper
On \(k\)-convex point sets2014-06-27Paper
Mutual witness proximity graphs2014-06-23Paper
Compatible spanning trees2014-04-09Paper
https://portal.mardi4nfdi.de/entity/Q57474142014-02-14Paper
Draining a polygon-or-rolling a ball out of a polygon2014-01-22Paper
Terrain Visibility with Multiple Viewpoints2014-01-14Paper
Colored Spanning Graphs for Set Visualization2013-12-20Paper
Plane Geometric Graph Augmentation: A Generic Perspective2013-09-25Paper
Witness Gabriel graphs2013-08-22Paper
Proximity graphs inside large weighted graphs2013-08-06Paper
Compatible Geometric Matchings2013-06-28Paper
A Polynomial Bound for Untangling Geometric Planar Graphs2013-06-28Paper
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω2013-06-24Paper
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION2013-06-24Paper
Coverage with \(k\)-transmitters in the presence of obstacles2013-03-25Paper
Universal Point Subsets for Planar Graphs2013-03-21Paper
Token graphs2012-12-27Paper
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs2012-12-04Paper
Non-crossing matchings of points with geometric objects2012-10-12Paper
Coverage restricted to an angle2012-07-13Paper
Bichromatic 2-Center of Pairs of Points2012-06-29Paper
On \(k\)-convex polygons2012-06-13Paper
Approximation of Point Sets by 1-Corner Polygonal Chains2012-05-30Paper
Every large point set contains many collinear points or an empty pentagon2012-01-24Paper
A generalized Winternitz theorem2012-01-13Paper
Witness Rectangle Graphs2011-08-12Paper
Witness (Delaunay) graphs2011-07-20Paper
Transforming Triangulations on Nonplanar Surfaces2011-06-17Paper
On crossing numbers of geometric proximity graphs2011-03-25Paper
Red-Blue Separability Problems in 3D2011-03-18Paper
Coverage with k-Transmitters in the Presence of Obstacles2011-01-10Paper
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons2010-12-03Paper
On the number of plane graphs2010-08-16Paper
A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING2010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35754442010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35754582010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35754702010-07-27Paper
The rotation graph of \(k\)-ary trees is Hamiltonian2010-06-09Paper
Matching Points with Things2010-04-27Paper
Augmenting the connectivity of outerplanar graphs2010-02-23Paper
ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS2010-02-12Paper
Discrete and Computational Geometry2010-02-05Paper
A polynomial bound for untangling geometric planar graphs2009-12-14Paper
On polygons enclosing point sets. II2009-12-09Paper
Highway hull revisited2009-11-16Paper
On triconnected and cubic plane graphs on given point sets2009-08-14Paper
Compatible geometric matchings2009-07-27Paper
Gray codes for non-crossing partitions and dissections of a convex polygon2009-06-30Paper
Small weak epsilon-nets2009-06-18Paper
Point set stratification and Delaunay depth2009-05-29Paper
Traversing a set of points with a minimum number of turns2009-05-06Paper
Matching points with squares2009-03-24Paper
Voronoi diagram for services neighboring a highway2009-03-23Paper
Traversing a set of points with a minimum number of turns2009-02-12Paper
Flips in planar graphs2008-10-22Paper
THE HEAVY LUGGAGE METRIC2008-09-29Paper
Optimal location of transportation devices2008-09-19Paper
Augmenting the connectivity of geometric graphs2008-06-18Paper
On embedding triconnected cubic graphs on point sets2008-06-05Paper
A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS2008-05-20Paper
Matching Points with Circles and Squares2008-03-18Paper
Necklaces, Convolutions, and X + Y2008-03-11Paper
On local transformations in plane geometric graphs embedded on small grids2007-12-03Paper
On polyhedra induced by point sets in space2007-11-30Paper
Encompassing colored planar straight line graphs2007-10-19Paper
Computational Science and Its Applications – ICCSA 20042007-07-19Paper
On the number of plane geometric graphs2007-07-19Paper
Efficient many-to-Many point matching in one dimension2007-07-19Paper
Geodesic ham-sandwich cuts2007-04-26Paper
Hamiltonicity and colorings of arrangement graphs2007-01-09Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Partitions of complete geometric graphs into plane trees2006-05-16Paper
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS2006-05-10Paper
Moving coins2006-04-28Paper
On the equipartition of plane convex bodies and convex polygons2006-01-23Paper
Graph Drawing2005-12-07Paper
Graphs of triangulations and perfect matchings2005-11-24Paper
Computing obnoxious 1-corner polygonal chains2005-11-01Paper
Games on triangulations2005-10-26Paper
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS2005-09-29Paper
https://portal.mardi4nfdi.de/entity/Q56926952005-09-28Paper
RED-BLUE SEPARABILITY PROBLEMS IN 3D2005-08-23Paper
ON FLIPS IN POLYHEDRAL SURFACES2005-06-22Paper
A problem on hinged dissections with colours2004-12-13Paper
Small strictly convex quadrilateral meshes of point sets2004-12-02Paper
Separability by two lines and by nearly straight polygonal chains2004-11-12Paper
A lower bound on the number of triangulations of planar point sets2004-10-01Paper
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS2004-09-29Paper
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q44741272004-08-04Paper
The weighted farthest color Voronoi diagram on trees and graphs.2004-01-23Paper
Chromatic variants of the Erdős--Szekeres theorem on points in convex position.2003-10-14Paper
Towards compatible triangulations.2003-08-17Paper
Optimal and suboptimal robust algorithms for proximity graphs2003-05-19Paper
Implicit convex polygons2003-04-27Paper
Graphs of non-crossing perfect matchings2003-03-25Paper
Packing trees into planar graphs2003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47961812003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q47961842003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q27525202003-01-26Paper
On local transformation of polygons with visibility properties.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47898062003-01-15Paper
Splitting a Delaunay triangulation in linear time2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q47785382002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q47785542002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q45513522002-09-05Paper
Sequences of spanning trees and a fixed tree theorem2002-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45477922002-08-21Paper
Structural tolerance and Delaunay triangulation2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27668142002-07-22Paper
On the minimum size of visibility graphs2002-07-14Paper
Reconfiguring convex polygons2002-01-14Paper
On the number of visibility graphs of simple polygons2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q27049912001-05-13Paper
Separating objects in the plane by wedges and strips2001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q49526122000-11-29Paper
Graph of triangulations of a convex polygon and tree of triangulations2000-11-13Paper
A class of point-sets with few \(k\)-sets2000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49400232000-03-01Paper
Flipping edges in triangulations1999-11-23Paper
Properties of random triangulations and trees1999-06-28Paper
Geometric tree graphs of points in convex position1999-05-24Paper
Stabbing information of a simple polygon1999-03-30Paper
Hiding points in arrangements of segments1997-07-07Paper
Onion polygonizations1997-02-27Paper
Triangulations, visibility graph and reflex vertices of a simple polygon1996-12-08Paper
Ears of triangulations and Catalan numbers1996-03-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ferran Hurtado