Ferran Hurtado
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ferran Hurtado has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Marc Noy
Dep. Matemàtica Aplicada II, Universitat Politècnica De Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
4 shared publications Marc Noy
2 shared publications- Vera Sacristán
Universitat Politecnica de Catalunya, Barcelona, Spain
2 shared publications A García Olaverri
1 shared publication- Alfredo García
Dpto. Métodos Estadísticos, Facultad de Ciencias, Universidad de Zaragoza, 50009 Zaragoza, Spain
1 shared publication - Bernard Chazelle
Princeton University
1 shared publication
Latest Publications
- 1 June 2004
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 20 (2) , 145-159
A Problem on Hinged Dissections with Colours
- 1 June 2004
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 20 (2) , 145-159
A Problem on Hinged Dissections with Colours
- 10 October 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (2) , 317-339
Small Strictly Convex Quadrilateral Meshes of Point Sets
- 10 October 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (2) , 317-339
Small Strictly Convex Quadrilateral Meshes of Point Sets
- 8 February 2003
- Published by Elsevier in Computational Geometry
- Vol. 25 (1-2) , 35-49
Optimal and suboptimal robust algorithms for proximity graphs
- 8 February 2003
- Published by Elsevier in Computational Geometry
- Vol. 25 (1-2) , 35-49
Optimal and suboptimal robust algorithms for proximity graphs
- 1 September 2002
- Published by Springer Nature in Algorithmica
- Vol. 34 (1) , 39-46
Splitting a Delaunay Triangulation in Linear Time
- 1 September 2002
- Published by Springer Nature in Algorithmica
- Vol. 34 (1) , 39-46
Splitting a Delaunay Triangulation in Linear Time
- 6 May 2002
- Published by Wiley in Journal of Graph Theory
- Vol. 40 (3) , 172-181
Packing trees into planar graphs
In this study, we provide methods for drawing a tree with n vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 172–181, 2002
- 6 May 2002
- Published by Wiley in Journal of Graph Theory
- Vol. 40 (3) , 172-181
Packing trees into planar graphs
In this study, we provide methods for drawing a tree with n vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 172–181, 2002
- 28 February 2002
- Published by Elsevier in Information Processing Letters
- Vol. 81 (4) , 223-230
On the minimum size of visibility graphs
- 28 February 2002
- Published by Elsevier in Information Processing Letters
- Vol. 81 (4) , 223-230
On the minimum size of visibility graphs
- 31 January 2002
- Published by Elsevier in Computational Geometry
- Vol. 21 (1-2) , 3-20
Sequences of spanning trees and a fixed tree theorem
- 31 January 2002
- Published by Elsevier in Computational Geometry
- Vol. 21 (1-2) , 3-20
Sequences of spanning trees and a fixed tree theorem
- 1 April 2001
- Published by Elsevier in Discrete Mathematics
- Vol. 232 (1-3) , 139-143
On the number of visibility graphs of simple polygons
- 1 April 2001
- Published by Elsevier in Discrete Mathematics
- Vol. 232 (1-3) , 139-143
On the number of visibility graphs of simple polygons
- Open Access
- 8 January 2001
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 109 (1-2) , 1
Foreword
- 8 January 2001
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 109 (1-2) , 1
Open AccessForeword
- 1 October 1999
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 22 (3) , 333-346
Flipping Edges in Triangulations
- 1 October 1999
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 22 (3) , 333-346
Flipping Edges in Triangulations