2003
O. Aichholzer, F.Aurenhammer, F. Hurtado,
H. Krasser. Towards compatible triangulations. Theoretical Computer Science,
Volume 296, Num. 1, pp. 3 - 13, 2003.
F. Hurtado, G. Liotta, H. Meijer. Efficient Computation of Proximity
Graphs. Computational Geometry Theory and Applications 25, num.1-2, pp 35
- 49, 2003.
Jerôme Galtier, Ferran Hurtado, Marc
Noy, Stephane Pérennes and Jorge Urrutia. Simultaneous edge flipping in triangulations.
International Journal of Computational Geometry and Applications, Volume
13, Number 2, April 2003 .
Manuel Abellanas,
Ferran Hurtado, Christian Icking, Elmar Langetepe, Rolf Klein, Lihong Ma,
Belén Palop, Vera Sacristán. Voronoi Diagram for services neighboring
a highway. Information Processing Letters, Volume 86, Issue 5, Pages 283-288,
June 2003.
colours. Jin Akiyama,
Ferran Hurtado, Criel Merino and Jorge Urrutia. A problem on hinged dissections with
To appear in Graphs and Combinatorics (accepted 2003).
F. Hurtado, C. Seara, S. Sethia.
Red-Blue Separability
Problems in 3D. To appear in Proc. CGA'03, LNCS series, Springer-Verlag.
N Coll, F. Hurtado, A. Sellarès, Approximating
planar subdivisions and generalized Voronoi diagrams from random sections. To appear in Proc. 19th European Conference on Computational
Geometry, Bonn, March 2003.
M. Houle, F. Hurtado, M. Noy, E. Rivera-Campo.
Graphs of triangulations and perfect matchings. To
appear in Proc. 19th European
Conference on Computational Geometry, Bonn, March 2003.
O. Aichholzer, D. Bremner, E. Demaine,
F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, S., J. Urrutia.
Geometric games on triangulations. To appear in Proc. 19th European Conference on
Compu-tational Geometry, Bonn, March 2003.
M. Abellanas, F. Hurtado, C. Icking,
L. Ma, B. Palop P. Ramos. Best fitting rectangles. To
appear in Proc. 19th European
Conference on Computational Geometry, Bonn, March 2003.
2002
O. Aichholzer, L. Alboul, F. Hurtado,
On flips in polyhedral surfaces. International Journal of Foundations of
Computer Science, Vol. 13 No. 2, pp. 303-311, 2002.
O. Aichholzer, F, Aurenhammer, F.
Hurtado, Sequences of spanning trees and a fixed tree theorem. Computational
Geometry Theory and Applications 21, num. 1-2, pp. 3-20, 2002.
E. Arkin, S. Fekete, F. Hurtado, J.
Mitchell, M. Noy, V. Sacristán, S. Sethia, On the reflexivity of point sets.
To appear in The Goodman-Pollack Festschrift (book by Springer) (accepted
2002).
P. Bose, F. Hurtado, H. Meijer, S.
Ramaswami, D. Rappaport, V. Sacristán, T. Shermer, G. Toussaint.
Finding specified sections of arrangements: 2D results. J. of Mathematical
Modelling and Algorithms Vol. 1, Num. 1, pp. 3-16, 2002.
P. Bose, F. Hurtado, E. Omaña, J.
Snoeyink, G. T. Toussaint, Aperture Angle Problems. Algorithmica Vol. 33, pp.
411-435, 2002.
D. Bremner, F. Hurtado, S. Ramaswami,
V. Sacristán, Small Convex Quadrangulations of Point
Sets. To appear in Algorithmica (accepted 2002).
B. Chazelle, O. Devillers, F. Hurtado,
M. Mora, V. Sacristán, M. Teillaud. Splitting a Delaunay triangulation in linear time.
Algorithmica Volume 34 - Number 1, pp. 39-46, 2002.
Devillers, F. Hurtado, G. Karolyi,
C. Seara. Chromatic variants of the Erdös-SzekeresTheorem. To appear in Computational
Geometry Theory and Applications (accepted 2002)
J.M. Díaz, F. Hurtado, M.
López, J.A. Sellarès. Optimal
Projections onto Grids. Ext. abstract in Proc. 18th European Conference on
Computational Geometry, pp. 51-55, Warsaw, April 2002.
J.M.
Díaz, F. Hurtado, H. Meijer, D. Rappaport, J.Antoni
Sellarès. The Largest
Empty Annulus Problem. 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).
García-Olaverri, C. Hernando, F. Hurtado, M. Noy,
J.Tejel, Packing trees into planar graphs. Journal of Graph Theory Volume
40, Issue 3, pp.172-181, 2002.
García-Olaverri, F. Hurtado, M. Noy,
J. Tejel, On the minimum size of visibility graphs. Information Processing
Letters Vol. 81, Num. 4, 28, pp. 223-230, 2002.
F. Gómez, F. Hurtado, S. Ramaswami,
V. Sacristán, G. Toussaint, Implicit convex polygons. J. of Mathematical
Modelling and Algorithms Vol. 1, Num. 1, pp. 57-85, 2002.
C.Hernando, F. Hurtado, M. Noy. Graph of non-crossing perfect matchings.
To appear in Graphs and Combinatorics (accepted 2002)
F. Hurtado, R. Klein, E. Langetepe, V. Sacristán,
The weighted farthest color Voronoi diagram on trees and graphs. Ext. abstract
in Proc. 18th European Conference on Computational Geometry, pp. 8-11, Warsaw,
April 2002.
Antonio Montes. A New Algorithm for
Discussing Gröbner Bases with Parameters. Journal of Symbolic Computation, 33, 1-2, pp.
183-208, 2002.
Antonio Montes. Edición de software
en CD-ROM: Discussing Parametric Gröbner Bases: dpgb software. ACM ISBN:
1-58113-582-3. Université de Lille, ISSAC'02. Julio 2002.
Antonio Montes. Discussing Parametric Gröbner Bases:
dpgb software. Actas
del EACA 2002, pp 165-170. Peñaranda de Duero. Septiembre 2002.
2001
M. Abellanas, M. Claverol, F. Hurtado,
Wedge transversals of segments. In Actas de los IX Encuentros de GeometrÍa
Computacional (in Spanish), pp. 75-84,Girona, 2001
M. Abellanas, F. Hurtado, C. Icking,
R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacristán, Farthest color Voronoi
diagram and related problems. In Proc. 17th European Conference on Computational
Geometry, pp. 113-116, 2001. Also in Actas de los IX Encuentros de Geometría
Computacional (in Spanish), pp.51-54, Girona, 2001.
M. Abellanas, F. Hurtado, C. Icking,
R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacristán, Smallest color-spanning
objects. To appear in Proc. 9th Annual European Symposium on Algorithms, Lecture
Notes in Computer Science, Springer-Verlag, 2001.
M. Abellanas, F. Hurtado, C. Icking,
R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacristán, Proximity problems
for time metrics induced by the L1 metric and isothetic networks. In Actas de los IX Encuentros de
GeometrÍa Computacional, pp. 175-182, Girona, 2001.
O. Aichholzer, L. Alboul, F. Hurtado,
On flips in polyhedral surfaces.To appear in Int. J. foundations of Computer
Science (accepted 2001). Extended abstract in Proc. 17th European Workshop
on Computational Geometry, Berlin, 2001.
O. Aichholzer, F. Aurenhammer, F.
Hurtado, Sequences of spanning trees and fixed-tree theorem. To appear in
Computational Geometry Theory and Applications (accepted 2001). Extended
abstract in Proc. 16th European Conference on Computational Geometry, Eilat,
2000.
O. Aichholzer, F. Aurenhammer, F.
Hurtado, H. Krasser, Towards compatible triangulations. Lecture Notes in
Computer Science 2108, pp. 101-110, Springer-Verlag (Proc. COCOON 2001. 7th
Annual International Computing and Combinatorics Conference, Guilin, China.).
O. Aichholzer, D. Bremner, E. Demanine, H. Meijer,
V. Sacristán, M. Soss, Long Proteins with unique Optimal Foldings in the
H-P Model. In Proc. 17th european Workshop on Computational Geometry, pp.
59-62, 2001.
O. Aichholzer, F. Hurtad, M. Noy, On the number
of triangulations every planar point set must have. Proceedings 13th Canadian
Conference on Computational Geometry, pp. 13-16, Waterloo, 2001.
H. Alt, F. Hurtado, Packing convex polygons into
rectangles. In Proc. Japanese Conf. on Discr. and Comp. Geom., Lecture Notes
in Computer Science 2098, Springer-Verlag, 2001, 2000.
E. Arkin, S. Fekete, F. Hurtado, J.
Mitchell, M. Noy, V. Sacristán, S. Sethia, On the reflexivity of point sets.
To appear in Proc. WADS 2001. Seventh International Workshop on Algorithms
and Data Structures, Lecture Notes in Computer Science, Springer-Verlag,
2001. Preliminary versions in Proc. Tenth Annual Fall Workshop On Computational
Geometry, Stony Brook, NY, October 2000, and in Actas de los IX Encuentros
de Geometría Computacional, pp. 239-248, Girona, 2001.
P. Bose, F. Hurtado, H. Meijer, S.
Ramaswami, D. Rappaport, V. Sacristán, T. Shermer, G. Toussaint, Finding Specified
Sections of Arrangements: 2D Results. To appear in International Journal
of Mathematical Algorithms (accepted 2001). Preliminary version in Proceedings
10th Canadian Conference on Computational Geometry, pp. 20-21, Montréal,
Canadá, 1998.
P. Bose, F. Hurtado, E. Omaña, J.
Snoeyink, G. T. Toussaint, Aperture Angle Problems. To appear in Algorithmica
(accepted 2001). Preliminary version in Proc. 7th Canadian Conference on
Computational Geometry, pp. 73-78, Québec, 1995. Spanish version: Optimización del
ángulo de apertura, Actas del IV Encuentro de Geometría Computacional, pp.14-20,
Granada, 1993.
D. Bremner, F. Hurtado, S. Ramaswami,
V. Sacristán, Small Convex Quadrangulations of Point
Sets.Lecture Notes in Computer Science 2223, Springer-Verlag, 2001, pp. 623-635
(Proc. Inte. Symp. on Algorithms and Computation (ISAAC), New Zealand,
J. M. Brunat, A. Montes, A determinant
related to a convex basis of the space of homogeneous polynomials. To appear
in SIAM Journal of Matrix
Analysis, 23, num 2, pp 459-471, 2001.
B. Chazelle, O. Devillers, F. Hurtado,
M. Mora, V. Sacristán, M. Teillaud, Splitting a Delaunay triangulation in
linear time. To appear in Algorithmica (accepted 2001).
Preliminary version to appear in Proc. 9th Annual European Symposium on Algorithms,
Lecture Notes in Computer Science, Springer-Verlag, 2001.
C. Cortés, C. Grima, F. Hurtado, A.
Márquez, F. Santos, J. Valenzuela, Transforming triangulations of polygons
on non planar surfaces. In Proc. 17th European Workshop on Computational
Geometry, pp. 31-34, 2001. Spanish version: Actas de los IX Encuentros de
Geometría Computacional, pp. 127-136, Girona, 2001.
J. Czyzowicz, F. Hurtado, J.e Urrutia,
N.b Zaguia, On polygons enclosing point sets. Geombinatorics,
Vol XI, Num. 1, pp. 21-28, 2001.
O. Devillers, R. Estkowski, P. -M.
Gandoin, F. Hurtado, P. Ramos, V. Sacristán, Minimal set of constraints for
2D Constrained Delaunay Reconstruction. Tech. report 4119, INRIA Sophia-Antipolis.
Spanish version: Actas
de los IX Encuentros de Geometría Computacional, pp. 167-174, Girona, 2001.
O. Devillers, F. Hurtado, M. Mora,
C. Seara, Separating several point sets in the plane. In Proc. 13th Canadian
Conference on Computational Geometry, Waterloo, 2001. Preliminary version in Actas de
los IX Encuentros de Geometría Computacional, pp. 107-116, Girona, 2001.
A. García, F. Hurtado, M. Noy, J.
Tejel, The size of visibility graphs. To appear in Information Processing
Letters (accepted 2001). Preliminary version in Proc. Int. Dagstuhl Seminar
on Computational Geometry, pp-
27-27, 1999. In Spanish in Actas de los VIII
Encuentros de Geometría Computacional, pp. 19-26, Castellón, 1999.
A. García-Olaverri, F. Hurtado, M.
Noy, J. Tejel, E. Abril, An algorithm for the augmentation of outerplanar
graphs to 2-connected outerplanar. Spanish version in Actas de los IX Encuentros de
Geometría Computacional, pp. 203-212, Girona, 2001.
A. García, M. Noy, J. Tejel, The asymptotic
number of spanning trees in d-dimensional lattices. To appear in J. Combinat.
Math. & Combinat. Comput. (accepted 2001).
F. Gómez, F. Hurtado, J.A. Sellarès,
G. Toussaint, Nice Perspective Projections. Journal of Visual Communication
and Image Representation Vol 12, n. 4, pp. 387-400, 2001.
F. Gómez, F. Hurtado, A. Sellarés
and G. Toussaint, On degeneracies removable by perspective projection, International Journal of Mathematic Algorithms, Vol 2 , pp.
227-248, 2001.
C. Hernando, M. Houle, F. Hurtado,
On Local Transformation of Polygons with Visibility Properties. To appear
in Theoretical Computer Science (accepted 2001). Preliminary version in Proc.
6th International Computing and Combinatorics Conference (COCOON'00), Sydney,
2000.
F. Hurtado, G. Liotta, H. Meijer,
Efficient Computation of Proximity Graphs. To appear in Proc. WADS 2001.
Seventh International Workshop on Algorithms and Data Structures, Providence,
USA, Lecture Notes in Computer Science, Springer-Verlag, 2001. Preliminary
version in Proc. Tenth Annual Fall Workshop On Computational Geometry, StonyBrook,
NY, October 2000. Extended abstract in Proc. 17th European Conference on Computational
Geometry, pp. 117-120, 2001.
F. Hurtado, M. Noy, On the number
of visibility graphs. Discrete Mathematics, Vol. 232, pp. 139-144, 2001.
F. Hurtado, M. Noy, P. A: Ramos, C.
Seara, Separating objects in the plane with wedges and strips. Discrete Applied
Mathematics 109, pp. 109-138, 2001. Preliminary version in Proceedings 10th
Canadian Conference on Computational Geometry, pp.50-51 , Montréal, Canadá,
1998. Also in Proc. 14th European Conference on Computational Geometry, pp-
97-98, 1998.
2000
O. Aichholzer, F. Aurenhammer, F. Hurtado, Sequences of spanning trees and fixed-tree theorem, Proc. 16th European Conference on Computational Geometry,
pp. 121-125, Eilat, 2000.
O. Aichholzer, E. Demaine, J. Erickson,
F. Hurtado, M. Overmars, M. Soss and G.Toussaint, Reconfiguring
Convex Polygons, aparecerá en Computational Geometry: Theory
and applications (acept. 2000). Extended abstract en
Proc.12th Canadian Conference on Computational Geometry, pp. 17-21, New Brunswick,
2000.
H. Alt, S. Felsner, F. Hurtado, M.
Noy and E. Welzl, On point sets with few k-sets Computational
Geometry: Theory and Applications, 16, pp. 95-101, 2000. Extended abstracts
en Proc. 14th ACM Symp. on Comp. Geom., pp. 200-205, Minneapolis, 1998, y
Proc. 14th European Conference on Computational Geometry, pp- 27-28, 1998.
H. Alt and F. Hurtado, Packing convex
polygons into rectangles, aparecerá en Proc. Japanese Conf. on
Discr. and Comp. Geom., Tokyo, 2000.
E. Arkin, S. Fekete, F. Hurtado, J.
Mitchell, M. Noy, V. Sacristán, S. Sethia, On the reflexivity of point sets,
Proc. Tenth Annual Fall Workshop On Computational Geometry,
Stony Brook, NY, 2000.
E. Arkin, F. Hurtado, J. Mitchell,
C. Seara, S. Skiena, Some separability problems on the plane, Proc. 16th European Conference on Computational Geometry, pp.
51-54, Eilat, 2000.
E.Arkin, F. Hurtado, J.Mitchell, C.
Seara and S. Skiena. Some lower bounds on geometric separability problems,
Proc. II Jornadas Españolas de Matemática Discreta, pp. 11-14, 2000.
J. M. Brunat, A. Montes, A determinant
related to a convex basis of the space of homogeneous polynomials, Actas EACA-2000, p. 149-162, Septiembre 2000.
J. M. Brunat, A. Montes, Nuevo algoritmo
para discutir sistemas polinómicos dependientes de parámetros. Actas EACA-2000, p. 297-310, Septiembre 2000.
E. Deutsch, M. Noy, New results on
non-crossing trees, Proc. FPSAC'00, Moscu, junio 2000, Springer
E. Deutsch, S. Feretic, M. Noy, Diagonally
convex directed polyominoes and even trees: a bijection and related issues,
Proc. LACIM 2000, Montreal, 2000, Publications du LACIM,
UQAM.
J. Miguel Díaz-Báñez, F. Gómez and
F. Hurtado, Approximation of point sets by 1-corner polygonal chains. INFORMS Journal of Computing vol. 12, núm. 4, 317-328. Versión preliminar en Proc. 10th Canadian Conference on Computational Geometry,
pp. 74-75, Montréal, Canadá, 1998 y en Actas de los VII Encuentros
de Geometría Computacional (in Spanish), pp. 239-250, Madrid, 1997.
H. Everett, C. Hoóng, K. Kilakos,
M. Noy, Planar segment visibility graphs, Comput. Geometry: Theory
and Appl. 16 (2000) 235-243.
V. Estivill-Castro, M. Noy, J. Urrutia,
On the chromatic number of tree-graphs, Discrete Mathematics
223 (2000) 363-366 .
S. Felsner, F. Hurtado, M. Noy and
I. Streinu, Hamiltonicity and colorings of arrangement graphs, Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 33-43,
San Francisco, 2000.
P. Flajolet, M. Noy, Analytic combinatorics
of chord diagrams, Proc. FPSAC'00, Moscu, junio 2000, Springer.
R. Guàrdia and F. Hurtado, On equipartitions
of convex polygons, 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, Casrtelló, 1999.
C. Hernando, M. Houle and F. Hurtado,
On Local Transformation of Polygons with Visibility Properties, Lecture Notes
in Computer Science 1858 (Proc. 6th International Computing and
Combinatorics Conference (COCOON'00), Sydney), Springer-Verlag, 2000,
pp. 54-63.
F. Hurtado, G. Liotta, H. Meijer,
Efficient Computation of Proximity Graphs, Proc. Tenth Annual
Fall Workshop On Computational Geometry, Stony Brook, NY, 2000.
F. Hurtado and M. M. Noy, On the number
of visibility graphs, to appear in Discrete Mathematics (aceptado
en 2000).
F. Hurtado, V. Sacristán and G. Toussaint,
Some constrained minimax and maximin location problems, Studies in Locational
Analysis. 15, pp. 17-35, 2000
C. Merino, A. de Mier, M. Noy, Irreducibility
of the Tutte polynomial of a connected matroid, Proc. ACOTA-2000, Merida (Mexico), noviembre
2000, a publicar por la Sociedad Matematica Mexicana.
A. de Mier, M. Noy, Grafos determinados
por su polinomio de Tutte, Actas de las II Jornadas Españolas
de Matemática Discreta, pp. 34-37, 2000, Palma, setembre 2000.
1999
M. Abellanas, F. Hurtado, P. Ramos,
Structural tolerance and Delaunay triangulation, Information
Processing Letters. Vol. 71, pp. 221-227, 1999. Spanish version: Tolerancia
de la triangulación de Delaunay, Actas del IV Encuentro de Geometría
Computacional, Granada, 1993, pp. 7-13.
D. Avis, B. Beresford, L. Devroye,
H. Elgindy, E. Guévremont, F. Hurtado and B. Zhu, Unoriented 1-maxima. Complexity and Algorithms, SIAM Journal on Computing, Vol. 28, No. 1, pp. 278-296, 1999.
F. Cobos, C. Dana, C. Grima, F.
Hurtado, A. Márquez, Computational geometry on the cylinder, Actas
de los VIII Encuentros de Geometría Computacional, pp. 109-118, Castellón,
1999.
N. Coll, F. Hurtado, X. Pueyo, Estructura
de visibilidad local para cálculos aproximados, Actas de los
VIII Encuentros de Geometría Computacional, pp. 227-236, Castellón, 1999.
L. Devroye, P. Flajolet, F. Hurtado,
M. Noy, W. Steiger, Properties of random triangulations and trees,
Discrete and Computational Geometry, Vol. 1, n. 22, pp. 105-117, 1999.
H. Everett, F. Hurtado and M. Noy,
Stabbing information of a simple polygon, Discrete
Applied Mathematics, 91, pp- 67-82, 1999. Abstract in
Proc. 8th Canadian Conference on Computational Geometry, 1996, pp.
74-79.
A. García, F. Hurtado, M. Noy, J.
Tejel, On the size of visibility graphs, Proc. Int. Dagstuhl
Seminar on Computational Geometry, pp- 27-27, 1999. In Spanish in Actas
de los VIII Encuentros de Geometría Computacional, pp. 19-26, Castellón,
1999.
R. Guàrdia, F. Hurtado, Partición
de polígonos convexos por cuerdas, Actas de los VIII Encuentros
de Geometría Computacional, pp. 83-92, Castellón, 1999.
Hernando, F. Hurtado, A. Márquez,
M. Mora, M. Noy, Geometric Tree Graphs of Points in Convex Discrete Applied
Mathematics 93, pp. 51-66, 1999. Spanish version in Actas
de de los VII Encuentros de Geometría Computacional, pp. 107-120, Madrid,
1997.
C. Hernando, F. Hurtado, M. Mora,
M. Noy, Nuevos resultados sobre grafos de árboles geométricos, Actas de los VIII Encuentros de Geometría Computacional, pp.
183-192, Castellón, 1999.
C. Hernando, F. Hurtado, M. Noy, Graphs of non-crossing
matchings, Proc. 15th European Conference on Computational Geometry,
pp- 97-100, 1999. In
Spanish in Actas de los VIII Encuentros de Geometría Computacional,
pp. 173-182, Castellón, 1999.
F. Hurtado, Una introducció a la
geometria computacional, Biaix, 14, pp. 11-20, 1999.
F. Hurtado, Geometria computacional:
una instantánea, La Gaceta de la RSME, 14, pp. 11-20, 1999.
F. Hurtado, M. Mora, P. Ramos, C. Seara, Two problems
on separability with lines and polygons, Proc. 15th European
Conference on Computational Geometry, pp- 33-36, 1999. In Spanish in Actas de los VIII Encuentros de Geometría Computacional, pp.
73-84, Castellón, 1999.
F. Hurtado, M. Noy, Graph of Triangulations
of a Convex Polygon and Tree of Triangulations, Computational
Geometry: Theory and Applications 13, pp. 179-188, 1999.
F. Hurtado, M. Noy, J. Urrutia, Flipping
Diagonals in Triangulations, Discrete and Computational Geometry,
Vol. 22, n. 3, pp. 333-346, 1999.
F. Hurtado, B. Palop, V. Sacristán,
Diagramas de Voronoi con distancias temporales, Actas de los
VIII Encuentros de Geometría Computacional, pp. 10-20, Castellón, 1999.
Montes. Basic Algorithms for Specialization in Gröbner
Basis. Actas del EACA'99,
pp 215-228. Sta. Cruz de Tenerife, Septiembre 1999.
1998
H. Alt, S. Felsner, F. Hurtado, M.
Noy, Point sets with few k-sets, Proc.
14th ACM Symp. on Comp. Geom., pp. 200-205, Minneapolis, 1998. An abstract
appeared also in Proc. 14th European Conference on Computational
Geometry, pp- 27-28, 1998.
P. Bose, F. Hurtado, H. Meijer, S.
Ramaswami, D. Rappaport, V. Sacristán, T. Shermer, G. Toussaint, Finding specified
sections of arrangements, Proceedings 10th Canadian Conference
on Computational Geometry, pp. 20-21, Montréal, Canadá, 1998.
C. Cortés, F. Hurtado, A. Márquez,
A. Nakamoto, Edge flipping in triangulations of surfaces, Actas
14th European Conference on Computational Geometry, pp- 59-60,
1998.
J. C. Dana, C. Grima, F. Hurtado,
A. Márquez, More results on computational geometry on the cylinder, Actas 14th European Conference on Computational
Geometry, pp- 61-64, 1998.
J. M. Díaz, F. Gómez, F. Hurtado,
Some problems on approximating a set of points by polygonal curves, Proceedings 10th Canadian Conference on Computational Geometry,
pp. 74-75, Montréal, Canadá, 1998.
A. García-Olaverri, C. Hernando, F.
Hurtado, M. Noy, J. Tejel, Packing trees into planar graphs, Proc.
Graph Drawing 97, Lecture Notes in Computer Science, 1353, pp. 383-390,
Springer-Verlag, 1998.
F. Gómez, F. Hurtado, G. Toussaint,
Nice projections and object reconstruction, Proc. Mathematics
and Design 98, pp. 441-450, Ed. Universidad del Pais Vasco, 1998.
F. Gómez, F. Hurtado, G. Toussaint,
Perspective projections and removal of degeneracies, Proceedings
10th Canadian Conference on Computational Geometry, pp. 100-101, Montréal,
Canadá, 1998.
F. Gómez, F. Hurtado, S. Ramaswami,
V. Sacristán, G. Toussaint, Implicit convex polygons, Actas 14th
European Conference on Computational Geometry, pp- 83-86, 1998.
C. Hernando, F. Hurtado, A. Márquez,
M. Mora, M. Noy, Geometric tree graphs of points in the plane,
Proceedings 10th Canadian Conference on Computational Geometry, pp. 40-41,
Montréal, Canadá, 1998.
F. Hurtado, M. Noy, Problemas de
combinatoria sobre puntos en el plano, Proc.Jornadas de Matemática
Discreta., pp. 48-51, Barcelona, 1998.
F. Hurtado, M. Noy, J. Urrutia, Parallel
edge flipping, Proceedings 10th Canadian Conference on Computational
Geometry, pp. 26-27, Montréal, Canadá, 1998.
F. Hurtado, V. Sacristán, G. Toussaint,
Constrained facility location, Proceedings 10th Canadian Conference
on Computational Geometry, pp. 24-25, Montréal, Canadá, 1998.
F. Hurtado, A. Sellarés, Verificación
de imágenes, Actas del VIII Congreso Español
de Informática Gráfica, pp. 163-176, Ourense, 1998.
A. Montes, Algebraic solution of the
load-flow problem for 4-nodes electrical network, Mathematics
and Computers in Simulation 45 (1998) 163-174.
1997
M. Abellanas, M. Claverol and F.
Hurtado, Estructuras de peso mínimo (in Spanish), Actas de de
los VII Encuentros de Geometría Computacional, pp. 97-106, Madrid, 1997.
M. Abellanas, J. García, G. Hernández,
M. Noy, P. Ramos, Bipartite embeddings of trees in the plane, Proc. Graph Drawing 96, Springer-Verlag LNCS 1190, pp.1-10,
1997..
J. M. Díaz, F. Gómez and F. Hurtado,
Localización de servicios poligonales con restricción en el número de codos
(in Spanish), Actas de de los VII Encuentros de Geometría Computacional,
pp. 239-250, Madrid, 1997.
H. Everett, C.T. Hoang, K. Kilakos
and M. Noy, Planar segment visibility graphs, Proc. 9th Canadian
Conference on Computational Geometry, pp. 65-69, Kingston, Canada, 1997.
P. Flajolet and M. Noy, Analytic Combinatorics
of Non-crossing Configurations, INRIA Report 3196, 1997.
Submitted to Discrete Mathematics.
A. García Olaverri, C. Hernando, F.
Hurtado, M. Noy, J. Tejel, Packing trees into planar graphs, Proc. Graph Drawing 97, Springer-Verlag
LNCS 1353, pp. 383-390 .
C. Hernando, F. Hurtado, A. Márquez,
M. Mora and M. Noy, Geometric Tree Graphs of Points in Convex Position, Abstracts 13th European Conference on Comp.
Geom., pp. 28-29, Würzburg, 1997.
F. Hurtado and M. Noy, Counting triangulations
of almost-convex polygons, Ars Combinatoria, Vol. 45, pp.
169-179, 1997.
F. Hurtado, M. Noy and C. Seara,
Separación de puntos mediante cuñas y bandas (in Spanish), Actas
de de los VII Encuentros de Geometría Computacional, pp. 45-56, Madrid,
1997.
F. Hurtado, M. Noy and Urrutia, Parallel
edge flipping::combinatorial bounds, Proc. Journées Francoespagnoles
de géométria algorithmique, pp. 49-52, Barcelona.
F. Hurtado, M. Noy and Urrutia,
Intercambio secuencial y paralelo de aristas en triangulaciones (in Spanish),
Actas de de los VII Encuentros de Geometría Computacional,
pp. 81-88, Madrid, 1997.
F. Hurtado, V. Sacristán and G. Toussaint,
Pruning can solve from facility location to visibility problems, Proc. Journées Francoespagnoles de géométria algorithmique, pp. 15-28, Barcelona.
F. Hurtado, V. Sacristán and G.
Toussaint, Angulo de apertura de visión en dos y tres dimensiones (in Spanish),
Actas de de los VII Encuentros de Geometría Computacional,
pp. 15-28, Madrid, 1997.
F. Hurtado and T. Sellarès, Proyecciones
perspectivas regulares. Correspondencia entre configuraciones (in Spanish),
Actas de de los VII Encuentros de Geometría Computacional,
pp. 57-70, Madrid, 1997.
E. Kranakis, D. Krizanc, A. Maheshwari,
M. Noy, J.-R. Sack and J. Urrutia, Stage-Graph Representations, Discrete Applied Mathematics,Vol. 75, pp. 71-80, 1997.
1996
M. Abellanas, G. Hernández, J. García,
F. Hurtado, O. Serra and J. Urrutia, Onion Polygonizations, Information Processing Letters, 57, pp.
165-173, 1996. Preliminary
Spanish version: Poligonizaciones cebolla, Actas del III Encuentro
de Geometría Computacional, pp. 77-88, Zaragoza, 1992.
E. Arkin, Y. J. Chiang, M. Held, J.
Mitchell, V. Sacristán, S. Skiena and T. C. Yang, On Minimum-Area Hulls,
Proc. of the 4th European Symposium on Algorithms, LNCS 1136,
Springer-Verlag, pp. 334-348, 1996. Full version to appear in Algorithmica.
F. Bauernoeppel, E. Kranakis, D. Krizanc,
A. Maheshwari, M. Noy, J.-R. Sack and J. Urrutia, Optimal ray-shooting, Lecture Notes in Computer Science, 944, pp. 220-231, Springer
Verlag, 1996 (Proceedings of ICALP 95).
G. Blanco, J. García, F. Hurtado,
P. Ramos and V. Sacristán, Incidence angle restricted visibility. Tech. Rep.
MA2-IR-96-004, Dept. Mat. Apl. II, Univ. Politècnica de Catalunya, 1996. Abstract in Abstracts
of the 12th European Workshop on Comp. Geometry, Münster, 1996, pp. 27-28.
F. J. Cobos, J. C. Dana, F. Hurtado,
A. Márquez and F. Mateos, On a Visibility Representation of Graphs, Graph Drawing 95. Lecture Notes in Computer Science,
1027, pp. 152-161, Springer Verlag, 1996. Spanish version: K_104080807 no es VHR-representable
en R^4 pero K_80 sí, Actas de los VI Encuentros de Geometría
Computacional, Barcelona, 1995, pp. 117-124.
N. Coll, F. Hurtado, and X. Pueyo,
Método de Montecarlo global y adaptativo para factores de forma (in Spanish),
Actas de las Jornadas Españolas de Informática Gráfica, pp. 183-192, 1196.
Also in Tech. Rep. IMA 96-5, Universitat de Girona,
1996.
F. Gómez, F. Hurtado and G.T. Toussaint,
Proyecciones de calidad (in Spanish), Actas del Congreso Español
de Informática Gráfica, Valencia, 1996, pp. 18-27.
F. Hurtado, Comprensió geomètrica
i eficiència algorísmica, Butlletí de la Societat Catalana de
Matemàtiques, Vol. 11, Num. 2, pp. 19-29, 1996.
F. Hurtado and M. Noy, Ears of Triangulations
and Catalan Numbers, Discrete Mathematics 149, pp. 319-324,
1996.
F. Hurtado and M. Noy, Triangulations,
visibility graph and reflex vertices of a simple polygon, Computational
Geometry: Theory and Applications, Vol. 6, pp. 355-369, 1996.
F. Hurtado, M. Noy, J . M. Robert, V. Sacristán and S. Skiena,
Visualizing objects with mirrors, Tech. Rep. 96-001, State University of
NewYork at Stony Brook, 1996. Spanish version (partial): Visualización de objetos
mediante espejos, Actas del VI Congreso Español de Informática
Gráfica, Valencia, 1996, pp. 18-27.
F. Hurtado, M. Noy and J. Urrutia,
Flipping Diagonals in Triangulations, Proceedings
12th ACM Conference on Computational Geometry, pp. 214-223, Philadelphia,
USA, 1996. Full paper submitted to Discrete and Computational
Geometry.
F. Hurtado, V. Sacristán and G. T.
Toussaint, Constrained minimax facility location, Tech.Rep. MA2-IR-96-010,
Dept. Mat. Apl. II,
Univ. Politècnica de Catalunya, 1996. Submitted to Studies in Locational
Analysis.
F. Hurtado, O. Serra and J. Urrutia,
Hiding Points in Arrangements of Segments, Discrete Mathematics,
Vol. 162, pp. 187-197, 1996
Montes. Solución algebraica del
problema del transporte eléctrico para una red de cuatro nodos. Actas del EACA'96, pp 33-45. Sevilla, Septiembre 1996.
1995
M. Abellanas, F. Hurtado and P. Ramos,
Redrawing a Graph Within a Geometric Tolerance, Graph Drawing
94. Lecture Notes in Computer Science, 894, pp. 246-253,
Springer Verlag, 1995.
M. Abellanas, F. Hurtado and P.
A. Ramos, Tolerancia de Arreglos de Segmentos (in Spanish), Actas
de los VI Encuentros de Geometría Computacional, Barcelona, 1995, pp.
77-84.
G. Blanco, J. García, F. Hurtado,
P. A. Ramos and V. Sacristán, Quality pictures,WWW Procedings
of the Fifth MSI Workshop on Computational Geometry at Stony Brook, 1995.
Spanish version: Fotografias
de calidad, Actas de los VI Encuentros de Geometría Computacional,
Barcelona, 1995, pp. 93-101.
P. Bose, F. Hurtado, E. Omaña, J.
Snoeyink and G. T. Toussaint, Aperture
Angle Problems, Proceedings 7th Canadian Conference on Computational
Geometry, pp. 73-78, Québec, Canada, 1995. Spanish version: Optimización del
ángulo de apertura, Actas del IV Encuentro
de Geometría Computacional, Granada, 1993, pp. 14-20. Full version submitted to Algorithmica.
A. García, M. Noy and J. Tejel. Lower
bounds for the number of crossing-free subgraphs of K_n. Proceedings
of the 7th Canadian Conference on Computational Geometry, pp. 89-95,
Québec, Canada, 1995. Full version to appear in Computational
Geometry: Theory and Applications.
R. Guàrdia and F. Hurtado, Cuadrados
inscritos en curvas poligonales de Jordan (in Spanish), Actas
de los VI Encuentros de Geometría Computacional, Barcelona, 1995, pp.
189-197.
Hernando, F. Hurtado and M. Noy,
Tipos de orden circulares (in Spanish), Actas de los VI Encuentros
de Geometría Computacional, Barcelona, 1995, 206-213.
F. Hurtado, M. Noy and S. Whitesides,
Finding optimal k-partitions for points in convex position, IR-95-10, Dept.
de Mat. Aplic. II, UPC,
1995.
F. Hurtado and J. Trias, Técnicas
geométricas para la informática gráfica: prácticas de laboratorio (in Spanish), Actas de las Jornadas sobre Nuevas Tecnologías
en la Enseñanza de las Matemáticas en la Universidad, Barcelona, 1995,
pp. 241-250.
A. Montes and J. Castro. Solving the
Load-Flow Problem using Gröbner Basis. SIGSAM Bull. 29, pp 1-13. 1995.
A. Montes. Software Geométrico-Gráfico
para Maple. Actas del TEMU'95. Barcelona, 1995.
M. Noy, Enumeration of non-crossing
trees, Proceedings of the 7th Conference on Formal Power Series and Algebraic
Combinatorics, 1995, pp. 441-449. To appear in Discrete Mathematics.
J. Trias and V. Sacristán, A Geometry
Lab with Mathematica, Mathematica in Education and Research,
Vol. 4, N. 2, 1995, pp. 23-30.
1994
M. Abellanas, J. García and F. Hurtado,
Consecutive Guards, Proceedings Sixth Canadian Conference on
Computational Geometry, pp. 393-398, Saskatoon, Canada, 1994.
M. Abellanas, F. Hurtado and P. Ramos,
Tolerance of Geometric Structures, Proceedings Sixth Canadian
Conference on Computational Geometry, pp. 250-255, Saskatoon, Canadá,
1994.
F. Hurtado and M. Noy, On the number
of visibility graphs of simple polygons, Snapshots of Computational
Geometry, D. Avis, P. Bose, Eds., pp. 100-107. McGill
University, 1994. Full version submitted to European Journal
of Combinatorics.
F. Hurtado and M. Noy, The Graph of
Triangulations of a Convex Polygon, IR-94-13, Dept. de Mat. Aplic. II, UPC, 1994. Abstract in Proceedings
12th ACM Conference on Computational Geometry, pp. C7-C8, Philadelphia,
USA, 1996. Full version submitted to Computational Geometry: Theory
and Applications.
F. Hurtado, M. Noy, O. Serra and
J. Trias, Actividades del Grupo de Investigación en Geometría Computacional
de la UPC (in Spanish), Actas del V Encuentro de Geometría Computacional, Santander, 1994, pp. 16-21.
A. Montes. Solución Numérica de
Sistemas de Ecuaciones mediante Bases de Gröbner. Métodos Numéricos
en Ingeniería. Ed. SEMNI, pp 981-987. 1994.
1993
M. Abellanas, J.
García, G. Hernández, F. Hurtado, O. Serra and J. Urrutia, Updating Polygonizations,
Computer Graphics Forum, vol. 12 no. 3, pp. 143-152, 1993.
F. Hurtado, Looking Through a Window,
Proceedings Fifth Canadian Conference on Computational Geometry,
pp. 234-239, St. John's, Canada, 1993.
F. Hurtado and M. Noy, El número
de triangulaciones de un polígono (in Spanish), Actas del IV Encuentro de Geometría Computacional, Granada, 1993,
pp. 1-6.
Montes. Numerical Conditioning of
a System of Algebraic Equations with a Finite Number of Solutions using Gröbner
Basis. SIGSAM Bull., 27, pp 12-19. 1993.
Montes. Un programa efectivo para
calcular las antiimágenes de la función de Euler. Actas de las
Jornadas de Nuevas Tecnologías en Matemáticas, pp 99-108. Valencia 1993.
1992
J. Czyzowicz, F. Hurtado, J. Urrutia
and N. Zaguia, Enclosible Sets, Proceedings Fourth Canadian Conference
on Computational Geometry, pp. 132-136, St. John's, Canadá, 1992.
F. Hurtado, Poligonizaciones simples
(in Spanish), Actas del III Encuentro de Geometría Computacional,
pp. 67-76, Zaragoza, 1992.