Publications

 ● Computational/combinatorial/discrete geometry
          ○ General            ○ The flip corner
 ● For nonspecialists
Back to the main page

Publications on discrete/combinatorial/computational geometry: General

Shortcuts (dates are for to the most visible version):
2014
2013
2012
2011
2010
2009 2008
2007
2006
2005
2004
2003
2002
2001
 XX

(send me a mail if a paper is not electronically available: FerranDOTHurtadoATupcDOTedu
2014
Draining a Polygon--or--Rolling a Ball out of a Polygon. Greg Aloupis, Jean Cardinal, Sebastien Collette, Ferran Hurtado, Stefan Langerman 
and Joseph O'Rourke
.
Computational Geometry: Theory and Applications, Volume 47, Issue 2C (February 2014), pp.316--328. http://dx.doi.org/10.1016/j.comgeo.2009.08.002
Ext. abstract in Proc. 20th Canadian Conference on Computational Geometry, August 2008, 79-82.

Compatible geometric trees. Alfredo García, Clemens Huemer, Ferran Hurtado, and Javier Tejel.
Computational Geometry: Theory and Applications, Volume 47, Issue 5 (July 2014), pp.563--584. http://dx.doi.org/10.1016/j.comgeo.2013.12.009 Preliminary abstract (in Spanish) in Proc. XII Encuentros de Geometría Computacional, Valladolid, 2007, 161-167.

Necklaces, Convolutions, and X+Y. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman,
Mihai Pǎtraşcu, Perouz Taslakian

Algorithmica, Volume 69, Issue 2 (June 2014), pp 294-314. http://dx.doi.org/10.1007/s00453-012-9734-3
Ext. abstract prel. version in Lecture Notes in Computer Science, Volume 4168, September 2006, pp.160-171. Proc. 14th Annual European Symposium on Algorithms (ESA 2006).

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Helmut Alt, Esther M. Arkin, Alon Efrat,
George Hart, Ferran Hurtado,
Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk.
Theory of Computing Systems, Volume 54, Issue 4,
(May 2014), pp. 689-714. http://dx.doi.org/10.1007/s00224-013-9493-9

Mutual Witness Proximity Graphs.
Boris Aronov, Muriel Dulieu, Ferran Hurtado. Information Processing Letters, Volume 114, Issue 10, October 2014, Pages 519-523. http://dx.doi.org/10.1016/j.ipl.2014.04.001

On k-Convex Point Sets.
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia,
Pavel Valtr, Birgit Vogtenhuber
. Computational Geometry: Theory and Applications, Volume 47, Issue 8, September 2014, Pages 809–832. http://dx.doi.org/10.1016/j.comgeo.2014.04.004
Blocking the k-holes of point sets on the plane. Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel, Jorge Urrutia.
Graphs and Combinatorics, to appear (accepted 2014).
Ex. abstract in Proc. XIV EGC, Alcalá de Henares, June 2011, pp. 141-144.

2013
Plane geometric graph augmentation: a generic perspective. Ferran Hurtado and Csaba D. Tóth.
In Thirty Essays on Geometric Graph Theory (J. Pach, ed.), vol. 29 of Algorithms and Combinatorics, Springer, 2013, 
pages 327-354, ISBN 978-1-4614-0109-4.

Coloring and Guarding Arrangements. Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Matias Korman, Perouz Taslakian.
Discrete Mathematics and Theoretical Computer Science, vol. 15, no. 3, pp. 139-154, 2013.
Abstract in Proc. 28th European Conference on Computational Geometry.March 2012 - Assisi, Italy, pp. 89-92.


Witness Gabriel graphs. Boris Aronov, Muriel Dulieu and Ferran Hurtado.
Computational Geometry: Theory and Applications, Volume 46, Issue 7 (October 2013), pp.894--908. http://dx.doi.org/10.1016/j.comgeo.2011.06.004
Abstract in Proc. 25th European Conference on Computational Geometry, Brussels, Belgium, 2009, pp. 13-16.

Coverage with k-Transmitters in the Presence of Obstacles. Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D.Demaine,
Vida Dujmovic, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán, Diane Souvaine, and Ryuhei Uehara

Journal of Combinatorial Optimization,Volume 25, Issue 2, pp 208-233. http://dx.doi.org/10.1007/s10878-012-9475-x
Ext. abstract in Proc. 4th International Conference on Combinatorial Optimization and Applications, Hawaii, 2010, LNCS 6508, Part II pp. 1-15.

Proximity Graphs Inside Large Weighted Graphs. Bernardo M. Ábrego, Ruy Fabila-Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza,
Ferran Hurtado, Henk Meijer, Vera Sacristán and Maria Saumell.

Networks,Volume 61, Issue 1, January 2013, Pages: 29–39. http://dx.doi.org/10.1002/net.21464
Ext. abstract in Proc. 26th European Conf. on Computational Geometry (EuroCG'10), pp. 9-12, 2010.
Some properties of k-Delaunay and k-Gabriel graphs. Prosenjit Bose, Victor A. Campos, Sébastien Collette, Ferran Hurtado, 
Matias Korman, Stefan Langerman, Vera Sacristán and Maria Saumell
Computational Geometry: Theory and Applications Volume 46, Issue 2, pages 131-139, 2013. http://dx.doi.org/10.1016/j.comgeo.2012.04.006
Ext. abstract in Proc. 22nd Canadian Conference on Computational Geometry, Winnipeg, 2010.
Non-crossing matchings of points with geometric objects. Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin Demaine, 
Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara and Perouz Taslakian.
Computational Geometry: Theory and Applications, Volume 45, Issue 1, pages 78-92, 2013. http://dx.doi.org/10.1016/j.comgeo.2012.04.005
Ext. abstract in Proc. LATIN'2010, LNCS 6034, pp. 456-467. Short abstract in Program of JCCGG'09.

Measuring regularity of convex polygons. Ramon Chalmeta, Ferran Hurtado, Vera Sacristán, Maria Saumell. Computer-Aided Design, Volume 45, Issue 2, pages 93-104, 2013. http://dx.doi.org/10.1016/j.cad.2012.07.012
Ext. abstract of experimental part of the paper in Proc. XIV EGC, Alcalá de Henares, June 2011, pp. 145-148.

Ext. abstract of part of the paper in Proc. 25th European Conference on Computational Geometry, Brussels, Belgium, 2009, pp. 125-128.

Ext. abstract of part of the paper in Proc. VI Jornadas de Matemática Discreta y Algorítmica, Lleida, 2008, pp. 401-408.


Proximity Drawings of High-Degree Trees. Ferran Hurtado, Giuseppe Liotta and David R. Wood.
International Journal of Computational Geometry and Applications, Vol 23, Issue 2, pages 213-230, http://dx.doi.org/10.1142/S0218195913500088.

Witness Rectangle Graphs. Boris Aronov, Muriel Dulieu and Ferran Hurtado.
To appear in Graphs&Combinatorics (accepted 2013).
Ext. abstract in Proc. WADS 2011 (LNCS), August 2011, Polytechnic Institute of New York University, Brooklyn, NY, USA, pp.72-85
Short abstract in 17th Fall Workshop on Computational Geometry, November 2007.

Distributed universal reconfiguration of 2D lattice-based modular robots. Ferran Hurtado, Enrique Molina, Suneeta Ramaswami, Vera Sacristán.
Abstract in 29th European Workshop on Computational Geometry, Braunschweig, Germany, March 18-20, pp. 139-142, 2013.

Balanced Partitions of 3-colored Geometric Sets in the Plane. Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara,
Carlos Seara, Rodrigo Silveira, Jorge Urrutia and Kevin Verbeek..

Abstract in 29th European Workshop on Computational Geometry, Braunschweig, Germany, March 18-20, pp. 165-168, 2013.


Stabbing simplices of point sets with k-flats. Javier Cano, Ferran Hurtado, and Jorge Urrutia.
Abstract in XIV EGC, Seville, June 2013, pp. 91-94.

Witness bar visibility. Carmen Cortés, Ferran Hurtado, Alberto Márquez, and Jesús Valenzuela.
Abstract in XIV EGC, Seville, June 2013, pp. 111-114.
Ext. abstract in Proc. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, México, November 11-15, pp. 77-87, 2013.

The alternating path problem revisited. Mercè Claverol, Delia Garijo, Ferran Hurtado, Dolores Lara and Carlos Seara.
Abstract in XIV EGC, Seville, June 2013, pp. 115-118.

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman,
Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl
.
Ext. abstract in Proc. 25th Canadian Conference on Computational Geometry, pp. 169-174, Waterloo, Ontario, Canada, August 2013.

On k-Enclosing Objects in a Coloured Point Set. Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison,
Matthew Skala and Mohammad Abdul Wahid
Ext. abstract in Proc. 25th Canadian Conference on Computational Geometry, pp. 229-234,Waterloo, Ontario, Canada, August 2013.

Colored Spanning Graphs for Set Visualization. Ferran Hurtado, Matias Korman, Marc Van Kreveld, Maarten Löffler, Vera Sacristán, Rodrigo Silveira
and Bettina Speckmann.
Proc. 21st International Symposium on Graph Drawing, Bordeaux, September 2013, LNCS 8242, pp. 283-294, Springer 2013.

Geometric Biplane Graphs I: Maximal Graphs. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo Silveira,
Javier Tejel, and Csaba D. Tóth
.
Ext. abstract in Proc. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, México, November 11-15, pp. 123-134, 2013.

Geometric Biplane Graphs II: Graph Augmentation. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo Silveira,
Javier Tejel, and Csaba D. Tóth
.
Ext. abstract in Proc. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, México, November 11-15, pp. 223-234, 2013.

Terrain visibility with multiple viewpoints. Ferran Hurtado, Maarten Löffler, Ines Matos, Vera Sacristán, Maria Saumell, Rodrigo Silveira and Frank Staals.
Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Hong-Kong, December 2013, LNCS 8283, pp. 317-327, Springer 2013.
2012
On k-Convex Polygons. Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran  Hurtado, Pedro Ramos and Jorge Urrutia.
Computational Geometry: Theory and Applications, Volume 45, Issue 3, Pages 73-87, 2012.
http://dx.doi.org/10.1016/j.comgeo.2011.09.001

Improving shortest paths in the Delaunay triangulation. Manuel Abellanas, Mercè Claverol, Gregorio Hernández, Ferran Hurtado, Vera Sacristán,
Maria Saumell and Rodrigo Silveira.
International Journal of Computational Geometry and Applications, Volume: 22, Number: 06 (2012), Pages: 559–576.
http://www.worldscientific.com/doi/pdf/10.1142/S0218195912500161.
Ext. abstract in Proc. 27th European Conf. on Computational Geometry (EuroCG), pp. xx-yy, and in Proc. XIV EGC, Alcalá de Henares, June 2011, pp. 117-120.

Proximity graphs: E, δ, Δ, χ and ω
. Prosenjit Bose, Vida Dujmović, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristan,
Maria Saumell, David Wood.

International Journal of Computational Geometry and Applications, Volume: 22, Number: 05 (October 2012), Pages: 439–469.
http://www.worldscientific.com/doi/pdf/10.1142/S0218195912500112 Ext. abstract in Proc. 28th European Conf. on Computational Geometry, March 20102, Assisi, Italy, pp. 217-220.

Token Graphs. Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R.Wood.
Graphs and Combinatorics, Volume 28, Issue 3, Pages 365-380, 2012. http://dx.doi.org/10.1007/s00373-011-1055-9
 
Bichromatic 2-center of pairs of points. Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell,
Belén Palop5, Pablo Pérez-Lantero, María Saumell, and Rodrigo I. Silveira.
Proc. LATIN 2012, Arequipa, Perú, April 2012, Lect. Notes Comp. Sci. 7256, pp. 25-35, Springer-Verlag, 2012.

Compatible Matchings for Bichromatic Plane Straight-line Graphs. Oswin Aichholzer, Ferran Hurtado, Birgit Vogtenhuber.
Proc. 28th European Conference on Computational Geometry.March 2012 - Assisi, Italy, pp. 257-260.

Universal Point Subsets for Planar Graphs. Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze,
Henk Meijer, Yoshio Okamoto
.
Proc. ISAAC 2012, Taipei, Taiwan, December 2012. Lecture Notes in Computer Science vol. 7676, pp. 423-434, Springer, 2012.
http://dx.doi.org/10.1007/978-3-642-35261-4_45, ISBN 978-3-642-35260-7
2011
On Crossings in Geometric Proximity Graphs. Bernardo M. Ábrego, Ruy Fabila, Silvia Fernández, David Flores, Ferran Hurtado, Vera Sacristán 
and Maria Saumell.
Computational Geometry: Theory and Applications, Volume 44, Issue 4, pp. 216-233, 2011.
Abstract in Proc. XIII Encuentros de Geometría Computacional Geometry, Zaragoza, Spain, 2009.
http://dx.doi.org/10.1016/j.comgeo.2010.11.003

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette,
Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood
Graphs and Combinatorics, Volume 27, Issue 1 (2011), pp. 47-60.
Abstract in Proc. 21st Canadian Conference on Computational Geometry, August 2008, 79-82.
http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00373-010-0957-2.

Witness (Delaunay) Graphs. Boris Aronov, Muriel Dulieu, Ferran Hurtado
Computational Geometry: Theory and Applications Vol. 44, Issues 6-7, pp: 329-344, 2011
Short abstract in Program of JCCGG'09.
http://dx.doi.org/10.1016/j.comgeo.2011.01.001

A Generalized Winternitz Theorem. Prosenjit Bose, Paz Carmi, Ferran Hurtado, Pat Morin.
Journal of Geometry, Volume 100, Numbers 1-2, 29-35, 2011.
http://dx.doi.org/10.1007/s00022-011-0076-0

Coverage Restricted to an Angle. Manuel Abellanas, Antonio L. Bajuelos, Ferran Hurtado, Inês Matos.
Operations Research Letters, Volume 39, Issue 4, July 2011, Pages 241-245. http://dx.doi.org/10.1016/j.orl.2011.04.011
A note on diagonal transformations on maximal planar graphs containing perfect matchings. Ferran Hurtado, Marc Noy, Eduardo Rivera.
Ex. abstract in Proc. XIV EGC, Alcalá de Henares, June 2011, pp. 157-160., pp. xx-yy.

Compatible matchings in geometric graphs. Oswin Aichholzer, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel.
Ex. abstract in Proc. XIV EGC, Alcalá de Henares, June 2011, pp. 145-148.

Convexifying Polygons Without Losing Visibilities. Oswin Aichholzer, Greg Aloupis, Erik Demaine, Martin Demaine,Vida Dujmovic,
Ferran Hurtado, Anna Lubiw,
Gü nter Rote, André Schulz, Diane Souvaine, Andrew Winslow.
Proc. 23rd Canadian Conference on Computational Geometry, Toronto,
August 2011.
2010

Transforming triangulations on non planar surfaces. Carmen Cortés, Clara Grima, Ferran Hurtado, Alberto Márquez, Francisco Santos, Jesús Valenzuela.
SIAM Journal on Discrete Mathematics, Vol. 24, Issue 3, pp. 821-840, 2010.
Prel. version in Proc. 17th European Conference on Computational Geometry, pp. 31-34, 2001.
Prel version in Actas de los IX Encuentros de Geometría Computacional (in Spanish), pp. 127-136, Girona, 2001.
http://dx.doi.org/10.1137/070697987

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, 
Thomas Hackl, Clemens Huemer, Ferran Hurtado and David R. Wood
Discrete Mathematics & Theoretical Computer Science, Vol. 12, Issue1, pp.75-86, 2010.
Abstract in Proc. of 24th European Conference on Computational Geometry, Nancy, March 2008, pp. 119-122
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/985

A Lower Bound on the Area of a 3-Coloured Disc Packing.
Peter Brass, Ferran Hurtado, Benjamin Lafreniè re and Anna Lubiw.
International Journal of Computational Geometry and Applications, Vol. 20, Issue 3, pp. 341-360, 2010.
Ext. abstract in Proc. 19th Canadian Conference on Computational Geometry, August 2007, 101-104.
http://dx.doi.org/10.1142/S0218195910003335


An algorithm for the augmentation of outerplanar graphs to 2-connected outerplanar
. Alfredo García-Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel.
Algorithmica, Vol. 56, Issue 2, pp: 160-179, 2010.
Abstract prel. version in Proc. IX Encuentros de Geometría Computacional (in Spanish), pp. 203-212, Girona, 2001.
http://www.springerlink.com/content/pg567082888m2384/

Highway Hull Revisited
. Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop

Computational Geometry: Theory and Applications, Vol. 43, Issue 2, pp: 115-130, 2010.
http://dx.doi.org/10.1016/j.comgeo.2009.06.001

Large bichromatic point sets admit empty monochromatic $4$-gons. Oswin Aichholzer, Thomas Hackl, Clemens Huemer,
Ferran Hurtado and Birgit Vogtenhuber.

SIAM Journal on Discrete Mathematics,Volume 23, Issue 4, pp. 2147-2155, 2010.
Ext. abstract in Proc. 25th European Conference on Computational Geometry, Brussles, Belgium,2009, pp. 133-136.
http://dx.doi.org/10.1137/090767947

Moving rectangles. Alfredo García, Clemens Huemer, Ferran Hurtado, and Javier Tejel.
Proc. VII Jornadas de Matemática Discreta y Algorítmica, Santander, 2010.

Proximity Graphs inside Large Weighted Graphs. Bernardo Ábrego, Ruy Fabila, Silvia Fernández-Merchant, David Flores, Ferran Hurtado,
Henk Meijer, Vera Sacristán and Maria Saumell.

Proc. 25th European Conference on Computational Geometry, Dortmund, Germany, 2010, pp. 9-12.
2009
A Polynomial Bound for Untangling Geometric Planar Graphs. Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Stefan Langerman, Pat Morin 
and David R. Wood.

Discrete & Computational Geometry,
Vol. 42, Issue 4, pp: 579-585, December 2009
Abstract  in Proc. of Topological&Geometric Graph Theory Int. Conf., Paris, May 2008

On structural and graph-theoretic properties of higher order Delaunay graphs with applications. Manuel Abellanas, Jit Bose, Jesús García, Ferran Hurtado, Mariano Nicolás and
Pedro Ramos.

International Journal of Computational Geometry and Applications, Vol. 9, Issue 6, pp: 595-615, December 2009
Abstract  in Proc. 20th European Conference on Computational Geometry,  pp. 119-122, 2005.
Abstract in Proc. 1st Joint International Meeting Amer. Math. Soc. / Real Soc. Mat. Esp., Seville, 2003.


On the Chromatic Numbers of Some Flip Graphs
. Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia,
David R. Wood

Discrete Mathematics & Theoretical Computer Science, Vol. 11, Issue 2, pp: 47-56, 2009
Ext. abstract in Proc. 24th European Conference on Computational Geometry, Graz, Austria, 2007, pp. 110-113.
Ext. abstract in Proc. XII Encuentros de Geometría Computacional, Valladolid, 2007, 223-229.

On triconnected and cubic plane graphs on given point sets
. Alfredo García, Clemens Huemer, Ferran Hurtado, Javier Tejel and Pavel Valtr.
Computational Geometry: Theory and Applications, Vol. 42, Issue 9, pp: 913-922, November 2009
Extended abstract in Proc. Eurocomb, Sevilla, Spain, September 2007, 464-471.

Connectivity-Preserving Transformation of Binary Images. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin
Computer Vision and Image Understanding, Volume 113, Issue 10, pp: 1027-1104, October 200
On polygons enclosing point sets II. Ferran Hurtado, Criel Merino, Déborah Oliveros, Toshinori Sakai , Jorge Urrutia, and Inmaculada Ventura. 
Graphs and Combinatorics, Vol. 25, Issue 3, pp: 327-339, August 2009
Proc. Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), xx-yy.
Abstract in Proc. XII Encuentros de Geometría Computacional, Valladolid, 2007, 179-186.
Compatible Geometric Matchings. Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado,
Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane Souvaine, Jorge Urrutia and David R. Wood.
Computational Geometry: Theory and Applications, Vol. 42, Issue 6, pp: 617-626, August 2009
Extemded abstract in Proc. of Topological&Geometric Graph Theory Int. Conf., Paris, May 2008, pp. 194-199.
Abstract 17th Fall Workshop on Computational Geometry, November 2007


Small weak epsilon nets
. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky
Computational Geometry: Theory and Applications, Vol. 42, Issue 5, pp: 455-462, July 2009
Abstract  in Proc. 17th Canadian Conf. on Computational Geometry, 2005.
Traversing a Set of Points with a Minimum Number of Turns. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, and Pavel Valtr. 
Discrete & Computational Geometry, Vol. 41, N. 9, pp: 513-432, June 2009.
Extended abstract in Proc. 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, 2007, pp. 46-55.

Gray codes for non-crossing partitions and dissections of a convex polygon. Clemens Huemer, Ferran Hurtado, Marc Noy, Elsa Omaña-Pulido.
Discrete Applied Mathematics Vol. 157, N. 6, pp: 1509-1520, April 2009.
Abstract in Proc. X Encuentros de Geometría Computacional, pp. 20-23, Sevilla, 2003.
Centerpoint theorems for wedges. Jeff Erickson, Ferran Hurtado, and Pat Morin.
Discrete Mathematics & Theoretical Computer Science, Vol. 11:1, pp. 45-54, March 2009.

Flips in planar graphs.
Prosenjit Bose, Ferran Hurtado
Computational Geometry: Theory and Applications,Vol. 42, Issue 1, January 2009, Pages 60-80.

Matching points with squares. Bernardo Ábrego, Estie Arkin, Silvia Fernández, Ferran Hurtado, Mikio Kano, Joseph Mitchell, Jorge Urrutia.
Discrete & Computational Geometry, Volume 41, number 1, pages 77-95, January 2009.

Some Regularity Measures for Convex Polygons. Ferran Hurtado, Vera Sacristán and Maria Saumell.
Proc. 25th European Conference on Computational Geometry, Brussels, Belgium, 2009, pp. 125-128.
Extended abstract in Proc. VI Jornadas de Matemática Discreta y Algorítmica, Lleida, 2008, pp. 401-408


Two-Convex Polygons. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Pedro Ramos and Jorge Urrutia.
Proc. 25th European Conference on Computational Geometry, Brussels, Belgium, 2009, pp.117-120.

On some partitioning problems for two-colored point sets. Clara Grima, Carmen Hernando, Clemens Huemer and Ferran Hurtado.
Proc. XIII Encuentros de Geometría Computacional Geometry, Zaragoza, Spain, 2009.
2008
The Rotation Graph of k-ary trees is Hamiltonian. C. Huemer, F. Hurtado, J. Pfeifle
Information Processing Letters, Volume 109, Issue 2, December 2008, Pages 124-129.
Abstract in Proc. 22nd European Conference on Computational Geometry, pp. 75-78, 2006.

The heavy-luggage metric
. Manuel Abellanas, Ferran Hurtado, Belén Palop
International Journal of Computational Geometry and Applications, Vol. 18, No. 4 (August 2008), pp. 295-306.
Extended abstract in Proc. 2nd International Symposium on Voronoi Diagrams in Science and Engineering (VD2005), pp. 56-63.

Augmenting the connectivity of geometric graphs. Manuel Abellanas, Alfredo García, Ferran Hurtado, Javier Tejel, Jorge Urrutia
Computational Geometry: Theory and Applications, Vol. 40, Issue 3, August 2008, Pages 220-230.
Proc. XI Encuentros de Geometría Computacional, Santander, 2005, pp. 149-156.

Matching Edges and Faces in Polygonal Partitions. Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer,
Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber.
Computational Geometry: Theory and Applications, Vol. 39 Issue 2 (February 2008), pp.134-141.
Abstract in Proc. 17th Canadian Conf. on Computational Geometry, 2005.

On local transformations in plane geometric graphs embedded on small grids. Manuel Abellanas, Prosenjit Bose, Alfredo García,
Ferran Hurtado, Pedro Ramos, Eduardo Rivera, Javier Tejel.
Computational Geometry: Theory and Applications, Vol. 39 Issue 2 (February 2008), pp.65-77.
Proc. International Conference on Computational Science and its Applications ICCSA 2004, LNCS 3045, pp. 22-31, 2004.

On Polyhedra Induced by Point Sets in Space. Pankaj Agarwal, Ferran Hurtado, Godfried Toussaint, and Joan Trias.
Discrete Applied Mathematics, Vol. 156 Issue 1 (January 2008), pp.132-144.
Ext. abstract in Proc. 15th Canadian Conf. on Computational Geometry, pp. 107-110, 2003.
Abstract in Proc.1st Joint International Meeting Amer. Math. Soc. / Real Soc. Mat. Esp., Seville, 2003.
Also in Abstracts of VII Congreso Nacional de Matematica y Computacion (COMPUMAT-2000), Manzanillo, Cuba, 2000.

Encompassing Colored Crossing-Free Geometric Graphs
. Ferran Hurtado, Mikio Kano, David Rappaport and Csaba Tóth.
Computational Geometry: Theory and Applications, Vol. 39 Issue 1 (January 2008), pp.14-23.
Extended abstract in Proc. 16th Canadian Conf. on Computational Geometry, pp. 48-52, 2004.

Optimal Location of Transportation Devices. Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, and Belén Palop.
Computational Geometry: Theory and Applications,  Vol. 41 N. 3, pp.219-229, 2008. 
Abstract as Moving Walkways, Escalators, and Elevators in Proc. Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007)
and in
Proc. XII Encuentros de Geometría Computacional, Valladolid, 2007, 27-34.


2007

A general approximation algorithm for planar maps with applications. Prosenjit Bose, Narcís Coll, Ferran Hurtado,
Antoni Sellarè s.

International Journal of Computational Geometry and applications, Vol. 17, Num. 6, (December. 2007).
Abstract in Proc. 18th European Conference on Computational Geometry, pp. 27-30, 2003.
Abstract in Proc. X Encuentros de Geometría Computacional, pp. 200-206, Sevilla, 2003.

On the Number of Plane Graphs
. Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser and Birgit Vogtenhuber.
Graphs and Combinatorics, Vol. 23 Suppl. 1, pp. 67-84 (June 2007).
Extended abstract in Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA'06, January 2006.
Click here to get a pdf version (219K).
Efficient Many-to-Many Point Matching in One Dimension. Justin Colannino, Mirella Damian, Ferran Hurtado,  Stefan Langerman, 
Henk Meijer, Suneeta Ramaswami, Diane Souvaine, Godfried Toussaint.

Graphs and Combinatorics, Vol. 23 Suppl. 1, pp. 169-178 (June 2007).
Geodesic ham-sandwich cuts. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, and Pat Morin.
Discrete and Computational Geometry,Volume 37, Num. 3, pp. 325-339, (March 2007)
Extended abstract in Proc. ACM Symposium on Computational Geometry, pp. 10-16, 2004.
Click here to get a pdf version (224K).

Point set stratification and Delaunay depth. Manuel Abellanas, Mercè Claverol and Ferran Hurtado.
Computational Statistics and Data Analysis, Volume 51, Issue 5,  pp. 2513-2530, (February 2007)
Abstract in Proc. 20th European Workshop on Computational Geometry 2004, pp. 101-106.
Click here to get a pdf version (716K).

On the number of non-crossing rays configurations. Alfredo García, Ferran Hurtado, Javier Tejel and Jorge Urrutia.
Abstract in Proc. XII Encuentros de Geometría Computacional, Valladolid, 2007, 129-134.

Vertex Pops and Popturns. Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik Demaine, Martin Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian and Godfried Toussaint.
Proc. 19th Canadian Conference on Computational Geometry, August 2007, 137-140.


2006
Hamiltonicity and colorings of arrangement graphs. Stefan Felsner, Ferran Hurtado, Marc Noy and Ileana Streinu. 
Discrete Applied Mathematics, Volume 154, Issue 17, pp. 2470-2483 (November 2006).
Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 33-43, San Francisco, 2000.
Click here to get a postscript version (1180K).

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment.
Justin Colannino, Mirella Damian, Ferran Hurtado, John Iacono,
Henk Meijer, Suneeta Ramaswami, Godfried Toussaint.

Journal of Computational Biology, Vol. 13, No. 4, Pages 979-989, (May 2006,).

Partitions of Complete Geometric Graphs into Plane Trees. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
Computational Geometry: Theory and Applications, Volume 34, Issue 2, Pages 116-125 (May 2006)
Extended abstract in Lecture Notes in Computer Science, Volume 3383, February 2005, pp. 71-81.Title:  Graph Drawing: 12th International Symposium, GD 2004, New
York, NY, USA, September 29-October 2, 2004, Revised Selected Papers.

Abstract in XI Encuentros de Geometría Computacional, Santander, 2005, pp. 157-164.
Click here to get a pdf version (261K).
Moving Coins. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo Garcia Olaverri, David Rappaport, Javier Tejel.
Computational Geometry: Theory and Applications, Volume 34, Issue 1, Pages 35-48 (April 2006)
Abstract in booklet of papers presented at Japan Conference on Discrete and Computational Geometry, Tokyo 2004.
Click here to get a pdf version (237K).

Computing obnoxious 1-corner polygonal chains. José Miguel Díaz-Bañez, Ferran Hurtado.
Computers & Operations Research, Volume 33, Issue 4, pp. 1117-1128 (April 2006).
Proc. X Encuentros de Geometría Computacional, pp. 220-224, Sevilla, 2003.

Some lower bounds on geometric separability problems. Estie Arkin, Ferran Hurtado, Joseph Mitchell, Carlos Seara and Steven Skiena.
International Journal of Computational Geometry and Applications, Vol. 16, No. 1, February 2006.
Extended abstract in Proc. II Jornadas Españolas de Matemática Discreta, pp. 11-14, 2000.
C
lick here to get a pdf version (264K).

Shortest tour of a sequence of disjoint segments in L_1. Estie Arkin, Alon Efrat, Cesim Erten, Ferran Hurtado, Joe Mitchell, Valentin Polishchuk, Carola Wenk
16th Annual Fall Workshop on Computational Geometry, Northampton, MA, 2006, to appear.

2005

On equipartitions of convex polygons. Roser Guàrdia and Ferran Hurtado.
Journal of Geometry, Volume 83, Numbers 1-2, pp. 32-45, December 2005
Proc. 16th European Conference on Computational Geometry, pp. 47-50, Eilat, 2000.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 83-92, Castelló, 1999.

Geometric games on triangulations. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia.
Theoretical Computer Science, Volume 343, Issues 1-2, pp. 42-71, October 2005.
Ext. abstract in Proc. Japan Conference on Discrete and Computational Geometry  2002, LNCS 2866, Springer-Verlag, pp. 22-37, 2003.
Abstract in Proc. 18th European Conference on Computational Geometry, pp. 89-92, 2003.
Abstract in Proc.1st Joint International Meeting Amer. Math. Soc. / Real Soc. Mat. Esp., Seville, 2003.
Click here to get a pdf version (286K).

Graphs of triangulations and perfect matchings. Michael H. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo.
Graphs and Combinatorics, Volume 21, Number 3, pp. 325-331, September 2005.
Ext. abstract in Proc. 18th European Conference on Computational Geometry, pp. 57-60, 2003.
Click here to get a postscript version (664K).

On the chromatic number of some geometric type Kneser graphs. Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia.
Computational Geometry Theory and Applications, Volume 32, Issue 1, September 2005, Pages 59-69.
Proc. X Encuentros de Geometría Computacional, pp. 44-50, Sevilla, 2003.
Click here to get a pdf version (97K).

Separating point sets in polygonal environments. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark Overmars, Sue Whitesides.
International Journal of Computational Geometry and Applications, Vol. 15 No. 4, pp. 403-420, August 2005.
Proc. ACM Symposium on Computational Geometry, pp. 1-9, 2004.
Click here to get a pdf version (207K).

Optimal Projections onto Grids and  Finite Resolution Images.  J.Miguel Díaz, Ferran Hurtado,  Mario López and J.Antoni Sellarè s.
Journal of Visual Communication and Image Representation, Volume 16, Issue 3, Pages 233-392, June 2005.
Abstract in Proc. 18th European Conference on Computational Geometry, pp. 51-55, Warsaw, April 2002.

Ext. abstract in Lecture Notes in Computer Science 2906, Springer-Verlag, 2003, pp.270-279 (Proc. Inte. Symp. on Algorithms and Computation (ISAAC), Kyoto, 2003).

Red-blue separability problems in 3D. Ferran Hurtado, Carlos Seara, Saurabh Sethia.
International Journal of Computational Geometry and Applications, Vol. 15 No. 2, pp. 167-192, April 2005.
Ext. abstract in Lecture Notes in Computer Science, Springer-Verlag 2669, pp. 766-775 (Proc. CGA-ICCSA 2003, Montréal, Canada, 2003).
Ext. abstract in Proc. 18th European Conference on Computational Geometry, pp. 97-100, 2003.
Also in Proc. X Encuentros de Geometría Computacional, pp. 88-94, Sevilla, 2003.
Click here to get a pdf version (230K).

On a triangle with the maximum area in a planar point set. Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia
Lecture Notes in Computer Science, Volume 3330, January 2005, pp.102-107. Title: Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers.

Locating obnoxious facilities with minimum interaction. José Miguel Díaz-Bañez, Ferran Hurtado, David Rappaport, Carlos Seara, Inmaculada Ventura.
Proc. International Symposium on Locational Decisions X, 119-122, 2005.

Gray codes and polytopal complexes for dissections of a polygon into k-gons. Clemens Huemer, Ferran Hurtado, Julian Pfeifle.
Proc. XI Encuentros de Geometría Computacional, Santander, 2005, pp. 31-38.

On the translational separation of colored convex objects. Ferran Hurtado, Mikio Kano.
Proc. XI Encuentros de Geometría Computacional, Santander, 2005, pp. 225-230.

2004

Separability by two lines and by near
ly-straight polygonal chains.
Ferran Hurtado, Mercè Mora, Pedro Ramos, Carlos Seara.
Discrete Applied Mathematics, Vol. 114, Issue 1-2, pp. 110-122, November 2004.
Proc. 15th European Conference on Computational Geometry, pp- 33-36, 1999.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 73-84, Castellón, 1999.

Click here to get a pdf version (163K).

A lower bound on the number of triangulations of planar point sets. Oswin Aichholzer, Ferran Hurtado and Marc Noy.
Computational Geometry Theory and Applications Volume 29, Issue 2, October 2004, pp. 135-145.
Proceedings 13th Canadian Conference on Computational Geometry, pp. 13-16, Waterloo, 2001.
Click here to get a postscript version (215K).

A problem on hinged dissections with colours. Jin Akiyama, Ferran Hurtado, Criel Merino and Jorge Urrutia.
Graphs and Combinatorics, Volume 20, Issue 2, pp. 145-160, June 2004.

Visualizing objects with mirrors. Ferran Hurtado, Marc Noy, Jean-Marc Robert, Vera Sacristán and Steve Skiena.
Computer Graphics Forum, Vol. 23, num. 2, pp. 157-166, June 2004.
Preliminary Spanish partial version in Actas del VI Congreso Español de Informática Gráfica, pp. 51-65.

The weighted farthest color Voronoi diagram on trees and graphs. Ferran Hurtado, Rolf Klein, Elmar Langetepe, and Vera Sacristán.
Computational Geometry Theory and Applications,  Volume 27, Issue 1, pp. 13-26, January 2004.
Ext. abstract in Proc. 18th European Conference on Computational Geometry, pp. 8-11, Warsaw, April 2002.
Click here to get a postscript version (195K).

Transportation networks and Voronoi Diagrams. Manuel Abellanas, Ferran Hurtado, Belén Palop.
Proc. Int. Symp. on Voronoi Diagrams in Science and Engineering, Univ. of Tokyo, pp. 203-212, September 2004.

Matching points with circles and squares. Bernardo Ábrego, Estie Arkin, Silvia Fernández, Ferran Hurtado, Mikio Kano, Joseph Mitchell, Jorge Urrutia.
Proc. Japan Conference on Discrete and Computational Geometry 2004, LNCS Springer-Verlag 3742, pp.1-15, 2005.
2003

Small Convex Quadrangulations of Point Sets. David Bremner, Ferran Hurtado, Suneeta Ramaswami, and Vera Sacristán.
Algorithmica, Volume 38, Number 2, pp. 317-339, November 2003.
Ext. abstract in Lecture Notes in Computer Science 2223, Springer-Verlag, 2001, pp. 623-635 (Proc. Inte. Symp. on Algorithms and Computation (ISAAC), New Zealand, 2001).
Click here to get a postscript version (450K).

Chromatic variants of the Erdös-SzekeresTheorem. Olivier Devillers, Ferran Hurtado, Gyula Kàrolyi and Carlos Seara.
Computational Geometry Theory and Applications, Volume 26, Issue 3, pp. 193-208, November 2003.
Ext. abstract in Proc. 18th European Conference on Computational Geometry, pp.84-86, Warsaw, April 2002.
Click here to get a postscript version (383K).

Minimal sets of constraints for 2D constrained Delaunay reconstruction
. Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos and Vera Sacristán.
International Journal of Computational Geometry and Applications, Vol. 13 No. 5, pp. 391-398, October 2003.
Actas de los IX Encuentros de Geometría Computacional (in Spanish), pp. 167-174, Girona, 2001.
Click here to get a pdf version (290K).

The Largest Empty Annulus Problem.  J.Miguel Díaz, Ferran Hurtado,  Henk Meijer, David Rappaport and J.Antoni Sellarè s.
International Journal of Computational Geometry and Applications, Vol. 13 No. 4, pp. 317-325, August 2003.
Extended abstract in Lecture Notes in Computer Science 2331, Springer-Verlag, 2002, pp. 46-54 (Proc. 2nd Intern. Workshop on  Comp. Geom. and Applic. (CGA'02)  Amsterdam,  April 2002).

On the reflexivity of point sets. Estie Arkin, Sandor Fekete, Ferran Hurtado, Joseph Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia.
Discrete and Computational Geometry: The Goodman-Pollack Festschrift. B. Aronov and S. Basu and J. Pach and M. Sharir, eds. Springer-Verlag, series Algorithms and Combinatorics, vol. 25, ISBN
3-540-00371-1
,  pp. 139--156, 2003.
Ext. abstract in Lect. Notes in Comp. Science 2125, Springer-Verlag, pp. 192-204 (Proc. WADS 2001. 7th International Workshop on Algorithms and Data Structures, Providence, USA).
Actas de los IX Encuentros de Geometría Computacional (in Spanish), pp. 239-248, Girona, 2001.
Click here to get a postscript version (1180K).

Voronoi Diagram for services neighboring a highway
. Manuel Abellanas, Ferran Hurtado, Christian Icking, Elmar Langetepe, Rolf Klein, Lihong Ma, Belén Palop, Vera Sacristán.
Information Processing Letters, Volume 86, Issue 5, Pages 283-288, June 2003.
Click here to get a pdf version (139K).

Towards compatible triangulations. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, and Hannes Krasser.
Theoretical Computer Science, Volume 296, Num. 1,  pp. 3 - 13, 2003.
Ext. abstract in Lecture Notes in Computer Science 2108, pp. 101-110, Springer-Verlag (Proc. COCOON 2001. 7th Annual International Computing and Combinatorics Conference, Guilin, China.).
Click here to get a postscript version (281K).

Efficient Computation of Proximity Graphs. Ferran Hurtado, Giuseppe Liotta and Henk Meijer.
Computational Geometry Theory and Applications 25, num.1-2, pp 35 - 49, 2003.
Lect. Notes in Comp. Science 2125, Springer-Verlag, pp. 2-14 Proc. WADS 2001. Seventh International Workshop on Algorithms and Data Structures, Providence, USA).
Abstract in Proc. Tenth Annual Fall Workshop On Computational Geometry, Stony Brook, NY, October 2000.
Extended abstract in Proc. 17th European Conference on Computational Geometry, pp. 117-120, 2001.
Click here to get a postscript version (283K).

Simultaneous edge flipping in triangulations. Jerôme Galtier, Ferran Hurtado, Marc Noy, Stephane Pérennes and Jorge Urrutia.
International Journal of Computational Geometry and Applications, Volume 13, Number 2, April 2003 .
Preliminary versions in Proc. 10th Canadian Conference on Computational Geometry, pp. 26-27, Montréal, 1998, and in Proc. Journées Francoespagnoles de Géométrie Algrithmique, pp. 49-52, Barcelona, 1997.
Click here to get a zipped version (1664K).

Best fitting rectangles. Manuel Abellanas, Ferran Hurtado, Christian Icking,  Lihong Ma, Belén Palop, Pedro A. Ramos
Ext. abstract in Proc. 18th European Conference on Computational Geometry, pp. 147-150, 2003.

Caminos Alternantes. Manuel Abellanas, Alfredo García, Ferran Hurtado, Javier Tejel.
Proc. X Encuentros de Geometría Computacional, pp. 7-12 (in Spanish), Sevilla, 2003.
Click here to get a pdf ENGLISH version (111K).

A note on contracting edges in convex decompositions. Ferran Hurtado and Eduardo Rivera.
Abstract in Proc. 1st Joint International Meeting Amer. Math. Soc. / Real Soc. Mat. Esp., Seville, 2003.

Grafos de árboles etiquetados y grafos de árboles geométricos etiquetados. Carmen Hernando, Ferran Hurtado, Mercè Mora, Eduardo Rivera Campo.
Proc. X Encuentros de Geometría Computacional, pp. 13-19 (in Spanish), Sevilla, 2003.

Propiedades del peso Delaunay. Manuel Abellanas, Mercè Claverol, Ferran Hurtado.
Proc. X Encuentros de Geometría Computacional, pp. 57-62 (in Spanish), Sevilla, 2003.

Bichromatic 2-center problem. Manuel Abellanas, Ferran Hurtado, Rolf Klein, ElmarLangetepe, Belén Palop, Vera Sacristán.
Proc. X Encuentros de Geometría Computacional, pp. 131-137, Sevilla, 2003.
2002

Splitting a Delaunay triangulation in linear time. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán and Monique Teillaud.
Algorithmica, Volume 34 - Number 1, pp. 39-46, 2002.
Lecture Notes in Computer Science 2161, pp. 312-320, Springer-Verlag (Proc. 9th Annual European Symposium on Algorithms, Aarhus, Denmark, 2001).
Actas de los IX Encuentros de Geometría Computacional (in Spanish), pp. 157-166, Girona, 2001.

Sequences of spanning trees and a fixed tree theorem . Oswin Aichholzer, Franz Aurenhammer and Ferran Hurtado.
Computational Geometry Theory and Applications 21, num. 1-2, pp. 3-20, 2002.
Proc. 16th European Conference on Computational Geometry, pp. 121-125, Eilat, 2000.
Click here to get a gzipped postscript version (117K).

Aperture Angle Problems. Prosenjit Bose, Ferran Hurtado, Elsa Omaña, Jack Snoeyink and Godfried T. Toussaint.
Algorithmica Vol. 33,  pp. 411-435, 2002.
Proc. 7th Canadian Conference on Computational Geometry, pp. 73-78, Québec, 1995.
Actas del IV Encuentro de Geometría Computacional( in Spanish), pp.14-20, Granada, 1993.
Click here to get a postscript version (281K).

On the minimum size of visibility graphs. Alfredo García-Olaverri, Ferran Hurtado, Marc Noy and Javier Tejel.
Information Processing Letters Vol. 81, Num. 4, 28, pp. 223-230, 2002.
Proc. VIII Encuentros de Geometría Computacional, pp. 19-26, Castellón, 1999.
Click here to get a postscript version (1350K).

On flips in polyhedral surfaces. Oswin Aichholzer, Lyuba Alboul and Ferran Hurtado.
International Journal of Foundations of Computer Science, Vol. 13 No. 2, pp. 303-311, 2002.
Ext. abstract in Proc. 17th European Conference on Computational Geometry, pp-.27-30, 2001.
Click here to get a gzipped postscript version (69K).

Packing trees into planar graphs. Alfredo García-Olaverri, Carmen Hernando, Ferran Hurtado, Marc Noy and Javier Tejel.
Journal of Graph Theory Volume 40, Issue 3, pp.172-181, 2002.
Lecture Notes in Computer Science 1353 (Proc. Graph Drawing 97), pp. 383-390, Springer-Verlag, 1998.

Implicit convex polygons. Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán and Godfried Toussaint.
J. of Mathematical Modelling and Algorithms Vol. 1, Num. 1, pp. 57-85, 2002.
Proc. 14th European Conference on Computational Geometry, pp- 83-86, 1998.

Finding specified sections of arrangements: 2D results. JitBose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, Dave Rappaport, Vera Sacristán, Tom Shermer and Godfried Toussaint.
J. of Mathematical Modelling and Algorithms Vol. 1, Num. 1, pp. 3-16, 2002.
Proceedings 10th Canadian Conference on Computational Geometry, pp. 20-21, Montréal, 1998.

Graph of non-crossing perfect matchings. Carmen Hernando, Ferran Hurtado and Marc Noy.
Graphs and Combinatorics Vol. 18, N. 3, pp. 517-532, 2002.
Proc. 15th European Conference on Computational Geometry, pp- 97-100, 1999.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 173-182, Castellón, 1999.

On Local Transformation of Polygons with Visibility Properties. Carmen Hernando, Michael Houle and Ferran Hurtado.
Theoretical Computer Science, Vol. 289, n. 2, pp. 919-937, 2002
Lecture Notes in Computer Science 1858 (Proc. 6th International Computing and Combinatorics Conference (COCOON'00), Sydney), Springer-Verlag, 2000, pp. 54-63.
Click here to get a postscript version (383K).

(a,k)-sets en el plano.
Manuel Abellanas, Mercè Claverol, Ferran Hurtado and Carlos Seara. Proc. III Jornadas Españolas de Matemática Discreta, pp. 11-14, 2002.

2001

On the number of visibility graphs of simple polygons. Ferran Hurtado and Marc Noy.
Discrete Mathematics, Vol. 232, pp. 139-144, 2001.
Snapshots of Computational Geometry, D. Avis, P. Bose, Eds., pp. 100-107. McGill University, 1994.

Reconfiguring Convex Polygons. Oswin Aichholzer, Erik Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Mike Soss and Godfried Toussaint.
Computational Geometry: Theory and Applications 20, num. 2, pp. 85-98, 2001.
Proc.12th Canadian Conference on Computational Geometry, New Brunswick, 2000.
Click here to get a gzipped postscript version (96K).

On polygons enclosing point sets. Jurek Czyzowicz, Ferran Hurtado, Jorge Urrutia and Najib Zaguia.
Geombinatorics, Vol XI, Num. 1, pp. 21-28, 2001.
Proc. Fourth Canadian Conference on Computational Geometry, pp. 132-136, St. John's, Canada, 1992.

On Degeneracies Removable by Perspective Projections. Francisco Gómez, Ferran Hurtado, Antoni Sellarè s and Godfried Toussaint.
Intern. J. of Mathematical Algorithms, Vol 2, pp 227-248, 2001.
Proc. 10th Canadian Conference on Computational Geometry, pp. 100-101, Montréal, 1998.

Separating objects in the plane with wedges and strips. Ferran Hurtado, Marc Noy, Pedro Ramos and Carlos Seara.
Discrete Applied Mathematics 109 (2001) 109-138
Proc. 10th Canadian Conference on Computational Geometry, pp. 50-51, Montréal, 1998.
Proc. 14th European Conference on Computational Geometry, pp- 97-98, 1998.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp. 45-56, Madrid, 1997.

Nice Perspective Projections. Francisco Gómez, Ferran Hurtado, Antoni Sellarè s and Godfried Toussaint.
Journal of Visual Communication and Image Representation Vol. 12, No. 4, pp 387-400, 2001.

Packing convex polygons into rectangles. Helmut Alt and Ferran Hurtado.
Lecture Notes in Computer Science 2098, Springer-Verlag, 2001, pp. 67-80 (Proc. Japanese Conf. on Discr. and Comp. Geom., Tokyo, 2000.

Furthest Color Voronoi Diagram and related problems. Manuel Abellanas, Ferran Hurtado, Christian Icking, Elmar Langetepe, Rolf Klein, Lihong Ma, Belén Palop, Vera Sacristán.
Ext. abstract in Proc. 17th European Conference on Computational Geometry, pp. 113-116, 2001.
Actas de los IX Encuentros de Geometría Computacional (in Spanish), pp. 51-54, Girona, 2001.

Smallest color-spanning objects. Manuel Abellanas, Ferran Hurtado, Christian Icking, Elmar Langetepe, Rolf Klein, Lihong Ma, Belén Palop, Vera Sacristán.
Lecture Notes in Computer Science, Springer-Verlag 2161, pp. 278-289 (Proc. 9th Annual European Symposium on Algorithms, Aarhus, Denmark, 2001).

Wedge transversals of segments. Manuel Abellanas, Mercè Claverol and Ferran Hurtado.
Actas de los IX Encuentros de GeometrÍa Computacional (in Spanish), pp. 75-84, Girona, 2001.

Separating several point sets in the plane. Olivier Devillers, Ferran Hurtado, Mercè Mora and Carlos Seara.
Proceedings 13th Canadian Conference on Computational Geometry, pp. 81-84, Waterloo, 2001.
Actas de los IX Encuentros de GeometrÍa Computacional (in Spanish), pp. 107-116, Girona, 2001.

Proximity problems for time metrics induced by the L1 metric and isothetic networks. Manuel Abellanas, Ferran Hurtado, Christian Icking, Elmar Langetepe, Rolf Klein, Lihong Ma, Belén Palop, Vera Sacristán.
Actas de los IX Encuentros de GeometrÍa Computacional (in Spanish), pp. 175-182, Girona, 2001.

XXth Century

On point sets with few k-sets. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy and Emo Welzl.
Computational Geometry: Theory and Applications 16, pp. 95-101, 2000.
Proc. 14th ACM Symp. on Comp. Geom., pp. 200-205, Minneapolis, 1998.
Proc. 14th European Conference on Computational Geometry, pp- 27-28, 1998
Click here to get a postscript version (171K).

Some constrained minimax and maximin location problems. Ferran Hurtado, Vera Sacristán and Godfried Toussaint.
Studies in Locational Analysis. 15, pp. 17-35, 2000
Proc. 10th Canadian Conf. on Comp. Geom., pp. 24-25, Montréal, 1998. Full paper: Tech. Rep. MA2-IR-96-010, Univ. Politè cnicade Catalunya, 1996.

Approximation of point sets by 1-corner polygonal chains. José Miguel Díaz-Báñez, Francisco Gómez and Ferran Hurtado.
INFORMS Journal of Computing Vol.12 No. 4 (2000) 317-328
Preliminary version in Proc. 10th Canadian Conference on Computational Geometry, pp. 74-75, Montréal, Canadá, 1998.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp. 239-250, Madrid, 1997.

Some separability problems on the plane. Esther Arkin, Ferran Hurtado, Joeseph Mitchell, Carlos Seara and Steve Skiena.
Proc. 16th European Conference on Computational Geometry, pp. 51-54, Eilat, 2000.

Structural tolerance and Delaunay triangulation. Manuel Abellanas, Ferran Hurtado and Pedro Ramos.
Information Processing Letters. Vol. 71, pp. 221-227, 1999.
Preliminary version in Proc. 10th European Conference on Computational Geometry, pp. 74-75, Santander, 1993.
Actas de los IV Encuentros de Geometría Computacional (in Spanish), pp. 7-13, Granada, 1993.

Unoriented Q-maxima. Complexity and Algorithms. David Avis, Brian Beresford, Luc Devroye, Hossam Elgindy, Eric Guévremont, Ferran Hurtado and Binhai Zhu.
SIAM Journal on Computing, Vol. 28, No. 1, pp. 278-296, 1999.

Flipping edges in triangulations. Ferran Hurtado, Marc Noy and Jorge Urrutia. Discrete and Computational Geometry 22:333-346 (1999).
Proc. 12th ACM Conference on Computational Geometry, pp. 214-223, Philadelphia, 1996.

Graph of triangulations of a convex polygon and tree of triangulations. Ferran Hurtado and Marc Noy. Computational Geometry: Theory and Applications 13(1999) 179-188.

Geometric tree graphs of points in convex position. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora and Marc Noy. Discrete Applied Mathematics 93 (1999) 51-66.
Proc. 10th Canadian Conference on Computational Geometry, pp. 40-41, Montréal, 1998.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp. 107-120, Madrid, 1997.

Properties of random triangulations and trees. Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy and William Steiger.
Discrete and Computational Geometry, Vol. 1, n. 22, pp. 105-117, 1999.

Stabbing information of a simple polygon. Hazel Everett, Ferran Hurtado and M. Noy.
Discrete Applied Mathematics, 91, pp- 67-82, 1999.
Proc. 8th Canadian Conference on Computational Geometry, 1996, pp. 74-79.

Una introducció a la geometria computacional (in Catalan). Ferran Hurtado.
Biaix, 14, pp. 11-20, 1999.

Geometria computacional: una instantánea (in Spanish). Ferran Hurtado.
La Gaceta de la RSME, 14, pp. 11-20, 1999.

Two problems on separability with lines and polygons. F. Hurtado, M. Mora, P. Ramos, C. Seara.
Proc. 15th European Conference on Computational Geometry, pp- 33-36, 1999.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 73-84, Castellón, 1999.

Computational geometry on the cylinder. Fco. Javier Cobos, Carlos Dana, Clara Grima, Ferran Hurtado and Alberto Márquez.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 109-118, Castellón, 1999.

Estructura de visibilidad local para cálculos aproximados. Narcís Coll, Ferran Hurtado and Xavier Pueyo.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 227-236, Castellón, 1999.

Nuevos resultados sobre grafos de árboles geométricos. C. Hernando, F. Hurtado, M. Mora, M. Noy.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 183-192, Castellón, 1999.

Diagramas de Voronoi con distancias temporales. F. Hurtado, B. Palop, V. Sacristán.
Actas de los VIII Encuentros de Geometría Computacional (in Spanish), pp. 10-20, Castellón, 1999.

Edge flipping in triangulations of surfaces. Carmen Cortés, Ferran Hurtado, Alberto Márquez and A. Nakamoto.
Proc. 14th European Conference on Computational Geometry, pp- 59-60, 1998.

More results on computational geometry on the cylinder. Juan Carlos Dana, Clara Grima, Ferran Hurtado and A. Márquez.
Proc. 14th European Conference on Computational Geometry, pp- 61-64, 1998.

Nice projections and object reconstruction. Francisco Gómez, Ferran Hurtado and Godfried Toussaint.
Proc. Mathematics and Design 98, pp. 441-450, San Sebastián, 1998.

Problemas de combinatoria sobre puntos en el plano. Ferran Hurtado and M. Noy.
Proc. Jornadas de Matemática Discreta (in Spanish), pp. 48-51, Barcelona, 1998.

Verificación de imágenes. Ferran Hurtado and Antoni Sellarés.
Actas del VIII Congreso Español de Informática Gráfica (in Spanish), pp. 163-176, Ourense, 1998.

Estructuras de peso mínimo. Manuel Abellanas, Mercè Claverol and Ferran Hurtado.
Actas de los VII Encuentros de GeometrÍa Computacional (in Spanish), pp. 97-106, Madrid, 1997.

Counting triangulations of almost-convex polygons. Ferran Hurtado and Marc Noy.
Ars Combinatoria, Vol. 45, pp. 169-179, 1997.
Click here to get a pdf version.

Intercambio secuencial y paralelo de aristas en triangulaciones. Ferran Hurtado, Marc Noy and Jorge Urrutia.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp. 81-88, Madrid, 1997.

Pruning can solve from facility location to visibility problems. Ferran Hurtado, Vera Sacristán and Godfried Toussaint.
Proc. Journées Francoespagnoles de Gémétrie Algrithmique, pp. 53-61, Barcelona, 1997.

Ángulo de apertura de visión en dos y tres dimensiones. Ferran Hurtado, Vera Sacristán and Godfried Toussaint.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp. 15-28, Madrid, 1997.

Proyecciones perspectivas regulares. Correspondencia entre configuraciones. Ferran Hurtado and Antoni Sellarè s.
Actas de los VII Encuentros de Geometría Computacional (in Spanish), pp.57-70, Madrid, 1997.

Onion Polygonizations. Manuel Abellanas, Gregorio Hernández, Jesús García, Ferran Hurtado, Oriol Serra and Jorge Urrutia.
Information Processing Letters, 57, pp. 165-173, 1996.
Actas del III Encuentro de Geometría Computacional (in Spanish), pp. 77-88, Zaragoza, 1992.

Incidence angle restricted visibility. Gregoria Blanco, Jesús García, Ferran Hurtado, Pedro Ramos and Vera Sacristán.
Proc. 12th European Conf. on Computational Geometry, pp. 27-28, Mü nster, 1996.
Actas de los VI Encuentros de Geometría Computacional (in Spanish), pp. 93-101, Barcelona, 1995.

On a Visibility Representation of Graphs. Fco. Javier Cobos, Juan Carlos Dana, Ferran Hurtado, Alberto Márquez and Felipe Mateos.
Lecture Notes in Computer Science 1027 (Proc. Graph Drawing 95), pp. 152-161, Springer-Verlag, 1996.
Actas de los VI Encuentros de Geometría Computacional (in Spanish), pp. 117-124, Barcelona, 1995.

Método de Montecarlo global y adaptativo para factores de forma. Narcís Coll, Ferran Hurtado, and Xavier Pueyo.
Actas de las Jornadas Españolas de Informática Gráfica (in Spanish), pp. 183-192, 1996.

Proyecciones de calidad. Francisco Gómez, Ferran Hurtado and Godfried T. Toussaint.
Actas del VI Congreso Español de Informática Gráfica (in Spanish), pp. 18-27, Valencia, 1996.

Comprensió geomè trica i eficiè ncia algorísmica. Ferran Hurtado.
Butlletí de la Societat Catalana de Matemàtiques(in Catalan), Vol. 11, Num. 2, pp. 19-29, 1996.

Ears of Triangulations and Catalan Numbers. Ferran Hurtado and Marc Noy.
Discrete Mathematics 149, pp. 319-324, 1996.

Triangulations, visibility graph and reflex vertices of a simple polygon. Ferran Hurtado and Marc Noy.
Computational Geometry: Theory and Applications, Vol. 6, pp.355-369, 1996.

Hiding Points in Arrangements of Segments. Ferran Hurtado, Oriol Serra and Jorge Urrutia.
Discrete Mathematics, Vol. 162, pp. 187-197, 1996.

Redrawing a Graph Within a Geometric Tolerance. Manuel Abellanas, Ferran Hurtado and Pedro Ramos.
Lecture Notes in Computer Science 894 (Proc. Graph Drawing 94), pp. 246-253, Springer-Verlag, 1995.
Prel. version: Proc. Sixth Canadian Conference on Computational Geometry, pp. 250-255, Saskatoon, 1994.

Tolerancia de Arreglos de Segmentos. Manuel Abellanas, Ferran Hurtado and Pedro Ramos.
Actas de los VI Encuentros de Geometría Computacional (in Spanish), pp. 77-84, Barcelona, 1995.

Cuadrados inscritos en curvas poligonales de Jordan. Roser Guàrdia and Ferran Hurtado.
Actas de los VI Encuentros de Geometría Computacional (in Spanish), pp. 189-197, Barcelona, 1995..

Tipos de orden circulares. Carmen Hernando, Ferran Hurtado and Marc Noy.
Actas de los VI Encuentros de Geometría Computacional (in Spanish), pp. 206-213, Barcelona, 1995.

Finding optimal k-partitions for points in convex position. Ferran Hurtado, Marc Noy and Sue Whitesides.
Tech. Report IR-95-10, Dept. de Mat. Aplic. II, UPC, 1995.

Técnicas geométricas para la informática gráfica: prácticas de laboratorio. Ferran Hurtado and Joan Trias.
Actas de las Jornadas sobre Nuevas Tecnologías en la Enseñanza de las Matemáticas en la Universidad (in Spanish), pp. 241-250, Barcelona, 1995.

Consecutive Guards. Manuel Abellanas, Jesús García and Ferran Hurtado.
Proc. Sixth Canadian Conference on Computational Geometry, pp. 393-398, Saskatoon, 1994.

Actividades del Grupo de Investigación en Geometría Computacional de la UPC. Ferran Hurtado, Marc Noy, Oriol Serra and Joan Trias.
Actas del V Encuentro de Geometría Computacional (in Spanish), pp. 16-21, Santander, 1994.

Updating Polygonizations. Manuel Abellanas, Jesús García, Gregorio Hernández, Ferran Hurtado, Oriol Serra and Jorge Urrutia.
Computer Graphics Forum, Vol. 12, Num. 3, pp. 143-152, 1993.

Looking Through a Window. Ferran Hurtado.
Proc. Fifth Canadian Conference on Computational Geometry, pp. 234-239, St. John's, 1993.

El número de triangulaciones de un polígono. Ferran Hurtado and Marc Noy.
Actas del IV Encuentro de Geometría Computacional (in Spanish), pp. 1-6, Granada, 1993.

Poligonizaciones simples. Ferran Hurtado.
Actas del III Encuentro de Geometría Computacional (in Spanish), pp. 67-76, Zaragoza, 1992.

Back to the main page

(Last update of this page: May 1, 2012)