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