The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ferran Hurtado: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manuel Abellanas, Jesus Garcia-Lopez, Ferran Hurtado
    Consecutive Guards. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:393-398 [Conf]
  2. Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos
    Tolerance of Geometric Structures. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:250-255 [Conf]
  3. Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
    Matching Edges and Faces in Polygonal Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:126-129 [Conf]
  4. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  5. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    On the number of triangulations every planar point set must have. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:13-16 [Conf]
  6. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
    Small weak epsilon nets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:52-56 [Conf]
  7. Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint
    Finding specified sections of arrangements: 2d results. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  8. Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara
    Separating several point sets in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:81-84 [Conf]
  9. José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado
    Some problems on approximation of set of points by polygonal curves. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  10. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:74-79 [Conf]
  11. Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint
    Perspective projections and removal of degeneracies. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  12. M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy
    Geometric tree graphs of points in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  13. Ferran Hurtado
    Looking through a Window. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:234-239 [Conf]
  14. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored crossing-free geometric graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:48-52 [Conf]
  15. Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
    Separating objects in the plane with wedges and strips. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  16. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Parallel edge flipping. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  17. Ferran Hurtado, Vera Sacristan, Godfried T. Toussaint
    Constrainted facility location. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  18. Ferran Hurtado, Godfried T. Toussaint, Joan Trias
    On Polyhedra Induced by Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:107-110 [Conf]
  19. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
    Towards Compatible Triangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:101-110 [Conf]
  20. M. Carmen Hernando, Michael E. Houle, Ferran Hurtado
    On Local Transformation of Polygons with Visibility Properties. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:54-63 [Conf]
  21. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy
    Point-Sets with few k-Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:200-205 [Conf]
  22. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  23. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  24. Ferran Hurtado, Marc Noy
    The Graph of Triangulations of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-7 [Conf]
  25. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:214-223 [Conf]
  26. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
    Traversing a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:46-55 [Conf]
  27. Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristan
    Smallest Color-Spanning Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:278-289 [Conf]
  28. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
  29. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
    Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:312-320 [Conf]
  30. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Edge Operations on Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:121-125 [Conf]
  31. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Separability Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:51-54 [Conf]
  32. Roser Guardia, Ferran Hurtado
    On the Equipartitions of Convex Bodies and Convex Polygons. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:47-50 [Conf]
  33. Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos
    Redrawing a Graph within a Geometric Tolerance. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:246-253 [Conf]
  34. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of Complete Geometric Graphs into Plane Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:71-81 [Conf]
  35. Francisco Javier Cobos, Juan Carlos Dana, Ferran Hurtado, Alberto Márquez, F. Mateos
    On a Visibility Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:152-161 [Conf]
  36. Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel
    Packing Trees into Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:383-390 [Conf]
  37. José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
    The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2002, pp:46-54 [Conf]
  38. Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel
    On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2004, pp:22-31 [Conf]
  39. Ferran Hurtado, Carlos Seara, Saurabh Sethia
    Red-Blue Separability Problems in 3D. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2003, pp:766-775 [Conf]
  40. David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
    Small Convex Quadrangulations of Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:623-635 [Conf]
  41. José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
    Optimal Point Set Projections onto Regular Grids. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:270-279 [Conf]
  42. Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
    Matching Points with Circles and Squares. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:1-15 [Conf]
  43. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Playing with Triangulations. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:22-37 [Conf]
  44. Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia
    On a Triangle with the Maximum Area in a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:102-107 [Conf]
  45. Helmut Alt, Ferran Hurtado
    Packing Convex Polygons into Rectangular Boxes. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:67-80 [Conf]
  46. Ferran Hurtado
    Squares. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:11-12 [Conf]
  47. Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser
    On the number of plane graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:504-513 [Conf]
  48. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:155-164 [Conf]
  49. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:192-204 [Conf]
  50. Ferran Hurtado, Giuseppe Liotta, Henk Meijer
    Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:2-13 [Conf]
  51. Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
    Some Aperture-Angle Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:411-435 [Journal]
  52. David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
    Small Strictly Convex Quadrilateral Meshes of Point Sets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:317-339 [Journal]
  53. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
    Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:39-46 [Journal]
  54. Ferran Hurtado, Marc Noy
    Counting triangulations of almost-convex polygons. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  55. Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia
    Updating Polygonizations. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1993, v:12, n:3, pp:143-152 [Journal]
  56. Ferran Hurtado, Marc Noy, J.-M. Robert, Vera Sacristan, Steven Skiena
    Visualizing Objects with Mirrors. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 2004, v:23, n:2, pp:157-166 [Journal]
  57. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
    Moving coins. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:35-48 [Journal]
  58. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
    Sequences of spanning trees and a fixed tree theorem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:3-20 [Journal]
  59. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  60. Oswin Aichholzer, Ferran Hurtado, Marc Noy
    A lower bound on the number of triangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:135-145 [Journal]
  61. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
    A class of point-sets with few k-sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:2, pp:95-101 [Journal]
  62. Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia
    On the chromatic number of some geometric type Kneser graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:1, pp:59-69 [Journal]
  63. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of complete geometric graphs into plane trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:116-125 [Journal]
  64. Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara
    Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:193-208 [Journal]
  65. Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
    The weighted farthest color Voronoi diagram on trees and graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:13-26 [Journal]
  66. Ferran Hurtado, Giuseppe Liotta, Henk Meijer
    Optimal and suboptimal robust algorithms for proximity graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:35-49 [Journal]
  67. Ferran Hurtado, Marc Noy
    Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:355-369 [Journal]
  68. Ferran Hurtado, Marc Noy
    Graph of triangulations of a convex polygon and tree of triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:3, pp:179-188 [Journal]
  69. José Miguel Díaz-Báñez, Ferran Hurtado
    Computing obnoxious 1-corner polygonal chains. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:1117-1128 [Journal]
  70. David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan
    Small Strictly Convex Quadrilateral Meshes of Point Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  71. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  72. Carmen Cortés, Clara I. Grima, Ferran Hurtado, Alberto Márquez, F. Santos, Jesus Valenzuela
    Transforming triangulations of polygons on non planar surfaces [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  73. Hazel Everett, Ferran Hurtado, Marc Noy
    Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:67-82 [Journal]
  74. M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy
    Geometric Tree Graphs of Points in Convex Position. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:51-66 [Journal]
  75. Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:1- [Journal]
  76. Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara
    Separability by two lines and by nearly straight polygonal chains. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:110-122 [Journal]
  77. Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
    Separating objects in the plane by wedges and strips. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:109-138 [Journal]
  78. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2470-2483 [Journal]
  79. Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger
    Properties of Random Triangulations and Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:1, pp:105-117 [Journal]
  80. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:333-346 [Journal]
  81. Ferran Hurtado, Marc Noy
    On the number of visibility graphs of simple polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:139-143 [Journal]
  82. Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia
    A Problem on Hinged Dissections with Colours. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:145-159 [Journal]
  83. C. Hernando, Ferran Hurtado, Marc Noy
    Graphs of Non-Crossing Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:517-532 [Journal]
  84. Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo
    Graphs of Triangulations and Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:325-331 [Journal]
  85. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Lower Bounds on Geometric Separability Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:1, pp:1-26 [Journal]
  86. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  87. Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro A. Ramos, Vera Sacristan
    Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:391-398 [Journal]
  88. José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
    The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:317-325 [Journal]
  89. Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia
    Simultaneous Edge Flipping in Triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:2, pp:113-133 [Journal]
  90. Ferran Hurtado, Carlos Seara, Saurabh Sethia
    Red-blue separability problems in 3D. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:2, pp:167-192 [Journal]
  91. Oswin Aichholzer, Lyuba Alboul, Ferran Hurtado
    On Flips in Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:303-311 [Journal]
  92. José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado
    Approximation of Point Sets by 1-Corner Polygonal Chains. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:4, pp:317-323 [Journal]
  93. Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia
    Onion Polygonizations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:3, pp:165-173 [Journal]
  94. Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos
    Structural Tolerance and Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:5-6, pp:221-227 [Journal]
  95. Manuel Abellanas, Ferran Hurtado, Vera Sacristan, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop
    Voronoi Diagram for services neighboring a highway. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:283-288 [Journal]
  96. Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
    On the minimum size of visibility graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:4, pp:223-230 [Journal]
  97. Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint
    Finding Specified Sections of Arrangements: 2D Results. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:3-16 [Journal]
  98. Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan, Godfried T. Toussaint
    Implicit Convex Polygons. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:57-85 [Journal]
  99. David Avis, Bryan Beresford-Smith, Luc Devroye, Hossam A. ElGindy, Eric Guévremont, Ferran Hurtado, Binhai Zhu
    Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:278-296 [Journal]
  100. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
    Games on triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:42-71 [Journal]
  101. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
    Towards compatible triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:3-13 [Journal]
  102. M. Carmen Hernando, Michael E. Houle, Ferran Hurtado
    On local transformation of polygons with visibility properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:919-937 [Journal]
  103. José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
    Optimal projections onto grids and finite resolution images. [Citation Graph (0, 0)][DBLP]
    J. Visual Communication and Image Representation, 2005, v:16, n:3, pp:233-249 [Journal]
  104. Manuel Abellanas, Mercè Claverol, Ferran Hurtado
    Point set stratification and Delaunay depth. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2007, v:51, n:5, pp:2513-2530 [Journal]
  105. Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint
    Vertex Pops and Popturns. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  106. Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw
    A Lower Bound on the Area of a 3-Coloured Disc Packing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:101-104 [Conf]
  107. Ferran Hurtado, Joseph S. B. Mitchell
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:1-2 [Journal]
  108. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored planar straight line graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:14-23 [Journal]
  109. Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
    Moving Walkways, Escalators, and Elevators [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  110. Manuel Abellanas, António Leslie Bajuelos, G. Hernández, Ferran Hurtado, Inês Matos, Belén Palop
    Good Illumination of Minimum Range [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  111. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  112. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]
  113. Ferran Hurtado, Oriol Serra, Jorge Urrutia
    Hiding points in arrangements of segments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:187-197 [Journal]
  114. Ferran Hurtado, Marc Noy
    Ears of triangulations and Catalan numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:319-324 [Journal]

  115. Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]


  116. Some properties of higher order delaunay and gabriel graphs. [Citation Graph (, )][DBLP]


  117. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]


  118. On properties of higher-order Delaunay graphs with applications. [Citation Graph (, )][DBLP]


  119. Matching Points with Things. [Citation Graph (, )][DBLP]


  120. Augmenting the Connectivity of Outerplanar Graphs. [Citation Graph (, )][DBLP]


  121. Matching edges and faces in polygonal partitions. [Citation Graph (, )][DBLP]


  122. On local transformations in plane geometric graphs embedded on small grids. [Citation Graph (, )][DBLP]


  123. Augmenting the connectivity of geometric graphs. [Citation Graph (, )][DBLP]


  124. Optimal location of transportation devices. [Citation Graph (, )][DBLP]


  125. Flips in planar graphs. [Citation Graph (, )][DBLP]


  126. On triconnected and cubic plane graphs on given point sets. [Citation Graph (, )][DBLP]


  127. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  128. Small weak epsilon-nets. [Citation Graph (, )][DBLP]


  129. Highway hull revisited. [Citation Graph (, )][DBLP]


  130. Point set stratification and Delaunay depth [Citation Graph (, )][DBLP]


  131. An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment [Citation Graph (, )][DBLP]


  132. A Lower Bound on the Area of a 3-Coloured Disk Packing [Citation Graph (, )][DBLP]


  133. Highway Hull Revisited [Citation Graph (, )][DBLP]


  134. On k-Convex Polygons [Citation Graph (, )][DBLP]


  135. Witness Gabriel Graphs [Citation Graph (, )][DBLP]


  136. Witness (Delaunay) Graphs [Citation Graph (, )][DBLP]


  137. Proximity Drawings of High-Degree Trees [Citation Graph (, )][DBLP]


  138. On polyhedra induced by point sets in space. [Citation Graph (, )][DBLP]


  139. Gray codes for non-crossing partitions and dissections of a convex polygon. [Citation Graph (, )][DBLP]


  140. Matching Points with Squares. [Citation Graph (, )][DBLP]


  141. Traversing a Set of Points with a Minimum Number of Turns. [Citation Graph (, )][DBLP]


  142. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002