{"id":92,"date":"2012-03-31T19:03:22","date_gmt":"2012-03-31T18:03:22","guid":{"rendered":"http:\/\/llati.upc.es\/verablog\/?page_id=92"},"modified":"2023-05-02T08:30:57","modified_gmt":"2023-05-02T07:30:57","slug":"pub","status":"publish","type":"page","link":"https:\/\/dccg.upc.edu\/people\/vera\/research\/pub\/","title":{"rendered":"Research publications"},"content":{"rendered":"

G. Esteban, D. Halperin, V. Ru\u00edz, V. Sacrist\u00e1n and R.I. Silveira
\nShortest coordinated motion for a pair of square robots<\/strong>
\nIn: Abstracts 39th Spanish Meeting on Computational Geometry<\/em>, Barcelona (Spain), March 29-31, pp. 21:1-21:8, 2023. Link<\/a>
\nPreliminary version: D. Halperin, V. Ruiz, V. Sacrist\u00e1n, R. Silveira, Optimal coordinate motions for two squares, <\/strong>Abstracts of the XVIII Spanish Meeting on Computational Geometry<\/em>, Girona (Spain), July 1-3, p. 65, 2019. Link<\/a><\/p>\n

\n

H. A. Akitaya, E. M. Arkin, M. Damian, E. D. Demaine, V. Dujmovi\u0107, R. Flatland, I. Parada, B. Palop, A. van Renssen, V. Sacrist\u00e1n
\nUniversal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers<\/strong>
\nAlgorithmica, Vol. <\/em>83(5), pp: 1316\u20131351, 2021. Link<\/a>
\nPreliminary version: 27th Annual European Symposium on Algorithms<\/em>, Munich (Germany), September 9-11, pp: 3:1-3:14, 2019. doi: 10.4230\/LIPIcs.ESA.2019.3. Link<\/a>
\nPreliminary abstract: Reconfiguring edge-connected pivoting modular robots, in Abstracts of the XVIII Spanish Meeting on Computational Geometry<\/em>, Girona (Spain), July 1-3, p. 64, 2019. Link<\/a><\/p>\n

\n

I. Parada, V. Sacrist\u00e1n, R. Silveira
\nA New Meta-Module for Efficient Reconfiguration of Modular Robots<\/strong>
\nAutonomous Robots<\/em>, 2021. Link<\/a>
\nPreliminary version: A New Meta-Module for Efficient Reconfiguration of Hinged-Units Modular Robots, in Proceedings IEEE International Conference on Robotics and Automation<\/em>, Stockholm (Sweden), May 16-21, pp. 5197 – 5202, 2016. Link<\/a>
\nPreliminary extended abstract: A new meta-module for efficient robot reconfiguration, in Abstracts XVI Spanish Meeting on Computational Geometry<\/em>, Barcelona (Spain), July 1-3, pp. 53-56, 2015. PDF<\/a><\/p>\n

\n

H. Akitaya, E.D. Demaine, A. Gonczi, D. Hendrickson, A. Hesterberg, M. Korman, O. Korten, J. Lynch, I. Parada and V. Sacrist\u00e1n
\nCharacterizing Universal Reconfigurability of Modular Pivoting Robots<\/strong>
\n 37th International Symposium on Computational Geometry (SoCG 2021), pp: 10:1-10:20<\/cite>, 2021. Link<\/a>
\n<\/em>Preliminary version in: Abstracts of the 37th European Workshop on Computational Geometry, <\/em>St. Petesburg (Russia), April 7-9, pp: 56:1-56:7, 2021. Link<\/p>\n

\n

I. Mantas, E. Papadopoulou, V. Sacrist\u00e1n and R.I. Silveira
\nFarthest Color Voronoi Diagrams: Complexity and Algorithms<\/strong>
\nIn: Kohayakawa Y., Miyazawa F.K. (eds) LATIN 2020: Theoretical Informatics. LATIN 2021<\/em>. LNCS, vol 12118, pp. 283-295, 2020. Link<\/a><\/p>\n

\n

J. Moreno and V. Sacrist\u00e1n
\nReconfiguring sliding squares in-place by flooding<\/strong>
\n36th European Workshop on Computational Geometry<\/em>, W\u00fcrzburg (Germany), March 16-18, pp: 32:1-32:7, 2020. Link<\/a><\/p>\n

\n

D. Duran, V. Sacrist\u00e1n, R.I. Silveira
\nMap construction algorithms: a local evaluation through hiking data
\n<\/strong>GeoInformatica<\/em>, Vol. 24, pp: 633-681, 2020. Link<\/a><\/p>\n

\n

C. Binucci, E. Di Giacomo, S-H. Hong, G. Liotta, H. Meijer, V. Sacrist\u00e1n, S. Wismath
\nColored Anchored Visibility Representations in 2D and 3D space
\n<\/strong>Computational Geometry – Theory and Applications<\/em>, Vol. 89, 2020. Link<\/a><\/p>\n

\n

V. Sacrist\u00e1n
\nComputational Geometry has a role to play in controlling modular robotic systems
\n<\/strong>Invited plenary talk at the 35th European Workshop on Computational Geometry<\/em>, Utrecht (The Netherlands), March 18-20, pp. 14-152019<\/p>\n

\n

I. Mantas, E. Papadopoulou, V. Sacrist\u00e1n, R. Silveira
\nLinear-size farthest color Voronoi diagrams: conditions and and algorithms
\n<\/strong>Abstracts of the 35th European Workshop on Computational Geometry<\/em>, Utrecht (The Netherlands), March 18-20, pp. 12:1-12:7, 2019. Link<\/a><\/p>\n

\n

J. Cardinal, V. Sacrist\u00e1n, R. I. Silveira
\nA Note on Flips in Diagonal Rectangulations <\/strong>
\nDiscrete Mathematics & Theoretical Computer Science<\/em>, Volume 20, N.2, pp:1-22, 2018. doi: 10.23638\/DMTCS-20-2-14. Link<\/a>
\nExtended abstract in Abstracts of the 34th European Workshop on Computational Geometry<\/em>, Berlin (Germany), March 20-23, pp. 46:1-46:6, 2018. Link<\/a>
\narXiv:1712.07919 [math.CO], 2017. Link<\/a><\/p>\n

\n

F. Hurtado, M. Korman, M. van Kreveld, M. L\u00f6ffler, V. Sacrist\u00e1n, A. Shioura, R. Silveira, B. Speckmann, T. Tokuyama
\nColored Spanning Graphs for Set Visualization<\/strong>
\nComputational Geometry – Theory and Applications<\/em>, Volume 68, pp. 262-276, 2018. doi: 10.1016\/j.comgeo.2017.06.006. Link<\/a>
\nPreliminary version: F. Hurtado, M. Korman, M. van Kreveld, M. L\u00f6ffler, V. Sacrist\u00e1n, R. Silveira, B. Speckmann, Colored Spanning Graphs for Set Visualization, Proc. 21st International Symposium on Graph Drawing<\/em>, Bordeaux (France), September 23-25, Springer-Verlag LNCS 8242, pp. 283-294, 2013. PDF<\/a><\/p>\n

\n

J. Gudmundsson, I. Kostitsyna, M. L\u00f6ffler, T. M\u00fcller, V. Sacrist\u00e1n, R. I. Silveira
\nTheoretical analysis of beaconless geocast protocols in 1D<\/strong>
\nProc. Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)<\/em>, New Orleans (USA), January 8-9, pp. 62-76, 2018. doi:\u00a010.1137\/1.9781611975062.7. Link<\/a>
\nPresliminary abstract:\u00a0J. Gudmundsson, I. Kostitsyna, M. L\u00f6ffler, T. M\u00fcller, V. Sacrist\u00e1n, R. I. Silveira, Beaconless geocast protocols are interesting, even in 1D.
\nAbstracts of the 32nd European Workshop on Computational Geometry<\/em>, Lugano (Switzerland), March 30 – April 1, pp. 227-230, 2016. PDF<\/a><\/p>\n

\n

K. Buchin, M. Buchin, D. Duran, B. T. Fasy, R. Jacobs, V. Sacrist\u00e1n, R. I. Silveira, F. Staals, C. Wenk
\nClustering Trajectories for Map Construction<\/strong>
\nProc. 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems<\/em>, Redondo Beach, CA (USA), November 07-10, pp. 14:1-14:10, 2017. doi: 10.1145\/3139958.3139964. Link<\/a><\/p>\n

\n

E. Tello, I. Marco, R. Padr\u00f3, J. Caravaca, L. G\u00f3mez, C. Cattaneo, J. Marull, F. Coll, R. Garrabou, X. Cuss\u00f3, V. Sacrist\u00e1n, C. Font, E. Gal\u00e1n, J. R. Olarieta
\nSinergies entre fluxos d’energia i de materials agraris, i l’estat ecol\u00f2gic del territori: l’exemple del Vall\u00e8s (1860-1999)<\/strong>
\nIn I. Cuadros, O. Fort, dirs., Recursos i territori: perspectiva hist\u00f2rica i nous equilibris<\/em>, Cosset\u00e0nia Ed., ISBN 978-84-9034-670-9, pp. 13-37, 2017. Link<\/a><\/p>\n

\n

V. Sacrist\u00e1n
\nGeometric Algorithms for lattice-based modular robots
\n<\/strong>Invited plenary talk at the Japan Conference on Discrete and Computational Geometry, Graphs and Games<\/em>, pp. 14-15, 2016. Link<\/a><\/p>\n

\n

D. Duran, V. Sacrist\u00e1n, R. Silveira
\nMap construction algorithms: an evaluation through hiking data<\/strong>
\nProceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems<\/em>, S. Francisco (USA), October 31, pp. 74-83, 2016. Link<\/a><\/p>\n

\n

E. Galan, R. Padr\u00f3, I. Marco, E. Tello, G. Cunfer, G. I. Guzm\u00e1n, M. Gonz\u00e1lez de Molina, F. Krausmann, S. Gingrich, V. Sacrist\u00e1n, D. Moreno
\nWidening the analysis of Energy Return On Investment (EROI) in agroecosystems: A proposal to study socio-ecological transitions to industrialized farm systems (the Vall\u00e8s County, Catalonia, c.1860 and 1999)<\/strong>
\nEcological Modelling<\/em>, Volume 336, pp. 13-25, 2016. Link<\/a> PDF<\/a><\/p>\n

\n

E. Tello, E. Gal\u00e1n, V. Sacrist\u00e1n, G. Cunfer, G.I. Guzm\u00e1n-Casado, M. Gonz\u00e1lez de Molina, F. Krausmann, S. Gingrich, R. Padr\u00f3, I. Marco, D. Moreno-Delgado
\nOpening the black box of energy throughputs in agroecosystems: a decomposition analysis of final EROI into its internal and external returns (the Vall\u00e8s County, Catalonia, c.1860 and 1999)<\/strong>
\nEcological Economics,<\/em> Volume 121, pp. 160-174, 2016. Link<\/a><\/p>\n

\n

E. Tello, E. Gal\u00e1n, G. Cunfer, G.I. Guzm\u00e1n-Casado, M. Gonz\u00e1lez de Molina, F. Krausmann, S. Gingrich, V. Sacrist\u00e1n, I. Marco, R. Padr\u00f3, D. Moreno-Delgado
\nA proposal for a workable analysis of Energy Return on Investment (EROI) in agroecosystems. Part I: Analytical approach<\/strong>
\nIFF Social Ecology Working Papers<\/em> 156, Vienna, 2015. Link<\/a><\/p>\n

\n

M. Perera, V. Sacrist\u00e1n
\nEfficient distributed and parallel reconfiguration of expand-contract modular robots<\/strong>
\nAbstracts XVI Spanish Meeting on Computational Geometry<\/em>, Barcelona (Spain), July 1-3, pp. 49-52, 2015. Link<\/a><\/p>\n

\n

O. Aichholzer, T. Hackl, A.Pilz, P. A. Ramos, V. Sacrist\u00e1n, B. Vogtenhuber
\nEmpty triangles in good drawings of the complete graph<\/strong>
\nGraphs and Combinatorics<\/em>, Volume 31, Issue 2, pp. 335-345, 2015. Link<\/a>
\nExtended abstract in Proc. 21st Mexican Conference on Discrete Mathematics and Computational Geometry<\/em>, Oaxaca (M\u00e9xico), November 11-15, pp. 21-29, 2013. Preliminary version: arXiv:1306.5081 [cs.CG]<\/a><\/p>\n

\n

F. Hurtado, E. Molina, S. Ramaswami, V. Sacrist\u00e1n
\nDistributed reconfiguration of 2D lattice-based modular robotic systems<\/strong>
\nAutonomous Robots<\/em>, Volume 38, Issue 4, pp. 383-413, 2015. Link<\/a>
\nExtended abstract: Distributed universal reconfiguration of 2D lattice-based modular robots. Proc. 29th European Workshop on Computational Geometry, <\/em> Braunschweig, Germany, March 18-20, pp. 139-142, 2013. PDF<\/a>
\nGo to the distributed 2D reconfiguration page<\/a><\/p>\n

V. Sacrist\u00e1n
\nControlling modular robotic systems: some ideas from Computational Geometry<\/strong>
\nO. Cheong, J. Erickson, M. Teillaud, Computational Geometry (Dagstuhl Seminar 15111), Dagstuhl Reports<\/em>, Volume 5, Issue 3, p. 53, 2015. Link<\/a> – Slides<\/a><\/p>\n

\n

F. Hurtado, M. L\u00f6ffler, I. P. Matos, V. Sacrist\u00e1n, M. Saumell, R. Silveira, F. Staals
\nTerrain visibility with multiple viewpoints<\/strong>
\nInternational Journal of Computational Geometry and Applications<\/em>, Volume 14, Issue 4, 2014. Link<\/a>
\nPreliminary version in Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013)<\/em>, Hong Kong, December 16-18, Springer-Verlag LNCS 8283, pp. 317-327, 2013. PDF<\/a>. Full version: arXiv:1309.4323 [cs.CG]<\/a><\/p>\n

\n

O. Aichholzer, T. Hackl, V. Sacrist\u00e1n, B. Vogtenhuber, R. Wallner
\nSimulating distributed algorithms for lattice agents<\/strong>
\nProc. 15th Spanish Meeting on Computational Geometry<\/em>, Sevilla, June 26-28, pp. 81-84, 2013. PDF<\/a>
\nGo to the simulators page<\/a><\/p>\n

\n

B. Brallinger, N. Benbernou, P. Bose, M. Damian, E. D. Demaine, V. Dumivic, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacrist\u00e1n, D. Souvaine, R. Uehara
\nCoverage with k<\/em>-Transmitters in the Presence of Obstacles<\/strong>
\nJournal of Combinatorial Optimization, <\/em>Vol. 25, N. 2, pp. 208-233, 2013. PDF<\/a>
\nPreliminary version in Proc. 4th Annual International Conference on Combinatorial Optimization and Applications<\/em>, LNCS 6509, pp.1-15, <\/em>Hawaii, December 18-20, 2010. PDF<\/a><\/p>\n

\n

B. M. \u00c1brego, R. Fabila-Monroy, S. Fern\u00e1ndez-Merchant, D. Flores-Pe\u00f1aloza, F. Hurtado, H. Meijer, V. Sacrist\u00e1n, M. Saumell
\nProximity Graphs inside Large Weighted Graphs<\/strong>
\nNetworks<\/em>, Vol. 61, N. 1, pp. 29-39,\u00a0 2013. PDF<\/a>
\nPreliminary version in Proc. 26th European Workshop on Computational Geometry (EuroCG’10)<\/em>, pp. 9-12, 2010. PDF<\/a><\/p>\n

\n

R. Chalmeta, F. Hurtado, V. Sacrist\u00e1n, M. Saumell
\nMeasuring regularity of convex polygons<\/strong>
\nComputer-Aided Design, <\/em> Vol. 45, pp. 93\u2013104, 2013. PDF<\/a>
\nGo to the regularity measures web page<\/a>
\nPreliminary partial abstract: R. Chalmeta, V. Sacrist\u00e1n, M. Saumell, Measuring regularity of convex polygons: experimental results, Proc. XIV Spanish Meeting on Computational Geometry, <\/em> Alcal\u00e1 de Henares (Spain), June 27-30, pp. 71-74, 2011. PDF<\/a>
\nPreliminary partial abstract: F. Hurtado, M. Saumell, V. Sacrist\u00e1n, Some regularity measures for convex polygons, Proc. 25th European Workshop in Computational Geometry<\/em>, pp. 125-129, 2009. PDF<\/a> (preliminary version in Proc. VI Jornadas de Matem\u00e1tica Discreta y Algor\u00edtmica<\/em>, pp. 401-408, 2008 PDF<\/a>).<\/p>\n

\n

P. Bose, S. Collette, F. Hurtado, M. Korman, S. Langerman, V. Sacrist\u00e1n, M. Saumell
\nSome properties of k<\/em>-Delaunay and k<\/em>-Gabriel graphs<\/strong>
\nComputational Geometry – Theory and Applications, <\/em> Vol. 46, N. 2, pp. 131\u2013139, 2013. PDF<\/a>
\nPreliminary version: Some Properties of Higher order Delaunay and Gabriel Graphs, Proc. 22nd Canadian Conference on Computational Geometry (CCCG’10)<\/em>, pp. 13-16, 2010. PDF<\/a><\/p>\n

\n

M. Abellanas, M. Claverol, G. Hern\u00e1ndez-Pe\u00f1alver, F. Hurtado, V. Sacrist\u00e1n, M. Saumell, R. I. Silveira
\nImproving shortest paths in the Delaunay triangulation<\/strong>
\nInternational Journal of Computational Geometry and Applications<\/em>, Vol. 22, N. 6, pp. 559-576, 2012. PDF<\/a>
\nPreliminary version in Proc. 27th European Workshop on Computational Geometry, <\/em> Morschach, Switzerland, March 28-30, pp. 43-46, 2011. PDF<\/a>
\nExtended abstract in Proc. XIV Spanish Meeting on Computational Geometry<\/em>, Alcal\u00e1 de Henares, Spain, June 27-30, pp. 117-120, 2011. PDF<\/a><\/p>\n

\n

P. Bose, V. Dujmovi\u0107, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacrist\u00e1n, M. Saumell, D. R. Wood
\nProximity graphs: E, \u03b4, \u0394, \u03c7 and \u03c9<\/strong>
\nInternational Journal of Computational Geometry and Applications<\/em>, Vol. 22, N. 5, pp. 439\u2013469, 2012. PDF<\/a>
\nPreliminary version: Proc. 28th European Workshop in Computational Geometry<\/em>, pp. 217-220, 2012. PDF<\/a><\/p>\n

\n

M. Buchin, A. Driemel, M. van Kreveld, V. Sacrist\u00e1n
\nSegmenting trajectories: A framework and algorithms using spatiotemporal criteria<\/strong>
\nJournal of Spatial Information Science<\/em>, Vol. 3, pp. 33-63, 2011. PDF<\/a>
\nPreliminary partial version: An Algorithmic Framework for Segmenting Trajectories based on Spatio-Temporal Criteria, Proc. 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems,<\/em> pp. 202-211, 2010. PDF<\/a><\/p>\n

\n

B. M. \u00c1brego, R. Fabila, S. Fern\u00e1ndez, D. Flores, F. Hurtado, V. Sacrist\u00e1n, M. Saumell
\nOn Crossing Numbers in Geometric Proximity Graphs<\/strong>
\nComputational Geometry – Theory and Applications<\/em>, Vol. 44, N. 4, pp. 216.233, 2011. PDF<\/a>
\nPreliminary version in Actas XIII Encuentros de Geometr\u00eda Computacional<\/em>, pp. 151-156, Zaragoza (Espa\u00f1a), 2009. PDF<\/a><\/p>\n

\n

G. Aloupis, S. Collette, M. Damian, E. D. Demaine, R. Flatland, S. Langerman, J. O’Rourke, V. Pinciu, S. Ramaswami, V. Sacrist\u00e1n, S Wuhrer
\nEfficient Constant-Velocity Reconfiguration of Crystalline Robots<\/strong>
\nRobotica<\/em>, Vol. 29, N. 1, pp. 59-71, 2011. PDF<\/a>
\nPreliminary version: Realistic Reconfiguration of Crystalline (and Telecube) Robots, Proc. 8th International Workshop on the Algorithmic Foundations of Robotics (WAFR 2008)<\/em>, 2008. PDF<\/a><\/p>\n

\n

G. Aloupis, S. Collette, M. Damian, E. D. Demaine, R. Flatland, S. Langerman, J. O\u2019Rourke, S. Ramaswami, V. Sacrist\u00e1n, S. Wuhrer
\nLinear Reconfiguration of Cube-Style Modular Robots<\/strong>
\nComputational Geometry – Theory and Applications<\/em> Vol. 42, N. 6-7, pp. 652\u2013663, 2009. PDF<\/a>
\nPreliminary version in Proc. 18th International Symposium on Algorithms and Computation (ISAAC2007)<\/em>, LNCS 4935, pp. 208-219, Springer-Verlag, 2007.PDF<\/a><\/p>\n

\n

M. Abellanas, G. Hern\u00e1ndez, V. Sacrist\u00e1n
\nCaminos de desviaci\u00f3n m\u00ednima local<\/strong>
\nActas XIII Encuentros de Geometr\u00eda Computacional<\/em>, pp. 285-292, Zaragoza (Espa\u00f1a), 2009. PDF<\/a><\/p>\n

\n

M. Abellanas, G. Hern\u00e1ndez, J. L. Moreno, S. Ord\u00f3\u00f1ez, V. Sacrist\u00e1n
\nDVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado<\/strong>
\nActas XIII Encuentros de Geometr\u00eda Computacional<\/em>, pp. 293-300, Zaragoza (Espa\u00f1a), 2009. PDF<\/a><\/p>\n

\n

G. Aloupis, S. Collette, E. D. Demaine, S. Langerman, S. Ramaswami, V. Sacrist\u00e1n, S. Wuhrer
\nReconfiguration of Cube-Style Modular Robots Using O(log n) Parallel Moves<\/strong>
\nProc. 19th International Symposium on Algorithms and Computation (ISAAC2008)<\/em>, LNCS 5369, pp. 342-353, Springer-Verlag, 2008. PDF<\/a><\/p>\n

\n

F.Hurtado, M.Noy, J.M.Robert, V.Sacrist\u00e1n and S.Skiena.
\nVisualizing Objects with Mirrors<\/strong>
\nComputer Graphics Forum<\/em>, Vol. 23, Num. 2, pp. 157-166, 2004. PDF<\/a>
\nPreliminary version in Technical Report 96-001, Computer Science Dept., State University of New York at Stony Brook, 1996. Spanish (partial) version in Actas del VI Congreso Espa\u00f1ol de Inform\u00e1tica Gr\u00e1fica<\/em>, pp.51-65, 1996.<\/p>\n

\n

F. Hurtado, R. Klein, E. Langetepe, V. Sacrist\u00e1n.
\nThe weighted farthest color Voronoi diagram on trees and graphs<\/strong>
\nComputational Geometry-Theory and Applications<\/em>, Vol. 27, Num. 1, pp. 13-26, 2004. PDF<\/a>
\nExtended abstract in Proc.18th European Conference on Computational Geometry<\/em>, pp. 8-11, 2002.<\/p>\n

\n

E. Arkin, S. Fekete, F. Hurtado, J. Mitchell, M. Noy, V. Sacrist\u00e1n, S. Sethia.
\nOn the Reflexivity of Point Sets<\/strong>
\nThe Goodman-Pollack Festschrift,<\/em> pp. 139-156, Springer-Verlag, 2003. Link<\/a>
\nPreliminary version in Proc. 7th International Workshop on Algorithms and Data Structures<\/em>, LNCS 2125, pp. 192-204, Springer-Verlag, 2001. PDF<\/a>
\nExtended Abstract in Actas de los IX Encuentros de Geometr\u00eda Computacional<\/em>, pp. 239-249, 2001. Abstract in Proc. Tenth Annual Fall Workshop On Computational Geometry<\/em>, Stony Brook, NY, October 2000.<\/p>\n

\n

D. Bremner, F. Hurtado, S. Ramaswami, and V. Sacrist\u00e1n.
\nSmall Strictly Convex Quadrilateral Meshes of Point Sets<\/strong>
\nAlgorithmica<\/em>, Vol. 38, Num. 2, pp. 317-339, 2003. PDF<\/a>
\nPreliminary version in Proc. Inte. Symp. on Algorithms and Computation 2001 (ISAAC)<\/em>, LNCS 2223, pp. 623-635, Springer-Verlag, 2001. PDF<\/a><\/p>\n

\n

M. Abellanas, F. Hurtado, C. Icking, E. Langetepe, R. Klein, L. Ma, B. Palop, V. Sacrist\u00e1n.
\nVoronoi Diagram for services neighboring a highway<\/strong>
\nInformation Processing Letters<\/em>, Vol. 86, Num. 5, pp. 283-288, 2003. PDF<\/a><\/p>\n

\n

O. Aichholzer, D. Bremner, E. Demaine, H. Meijer, V. Sacrist\u00e1n, M. Soss
\nLong Proteins with Unique Optimal Foldings in the H-P Model<\/strong>
\nComputational Geometry – Theory and Applications<\/em>, Vol. 25, pp. 139-159, 2003. PDF<\/a>
\nExtended Abstract in Proc. 17th European Workshop on Computational Geometry<\/em>, pp. 59-62, 2001.<\/p>\n

\n

O. Devillers, R. Estkowski, P. M. Gandoin, F. Hurtado, P. Ramos, V. Sacrist\u00e1n
\nMinimal Set of Constraints for 2D Constrained Delaunay Reconstruction<\/strong>
\nInternational Journal of Computational Geometry and Applications<\/em>, Vol. 13, Num. 5, pp. 391-398, 2003. PDF<\/a>
\nPreliminary version in Technical Report 4119, INRIA Sophia-Antipolis, 2000. Extended abstract (in spanish) in\u00a0 Actas de los IX Encuentros de Geometr\u00eda Computacional<\/em>, pp. 167-174, 2001.<\/p>\n

\n

M. Abellanas, F. Hurtado, R. Klein, E. Langetepe, B. Palop, V. Sacrist\u00e1n.
\nBichromatic 2-center problem<\/strong>
\nActas de los X Encuentros de Geometr\u00eda Computacional<\/em> (in Spanish), pp. 131-137, Sevilla, 2003. PDF<\/a><\/p>\n

\n

P. Bose, F. Hurtado, H. Meijer, S. Ramaswami, D. Rappaport, V. Sacrist\u00e1n, T. Shermer and G. Toussaint.
\nFinding Specified Sections of Arrangements: 2D Results<\/strong>
\nIn Journal of Mathematical Modeling and Algorithms<\/em>, Vol. 1, Num. 1, pp. 3-16, 2002. PDF<\/a>
\nPreliminary version in Proc. 10th Canadian Conference on Computational Geometry<\/em>, pp. 20-21, 1998.<\/p>\n

\n

B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacrist\u00e1n, M. Teillaud.
\nSplitting a Delaunay Triangulation in Linear Time<\/strong>
\nAlgorithmica<\/em>, Vol 34, Num. 1, pp. 39-46, 2002. PDF<\/a>
\nPreliminary version in Proc. 9th Annual European Symposium on Algorithms<\/em>, LNCS 2161, pp. 312-320, Springer-Verlag, 2001. PDF<\/a>
\nExtended abstract in Actas de los IX Encuentros de Geometr\u00eda Computacional<\/em> (in Spanish), pp. 157-166, Girona, 2001.<\/p>\n

\n

F. G\u00f3mez, F. Hurtado, S. Ramaswami, V. Sacrist\u00e1n and G. Toussaint.
\nImplicit Convex Polygons<\/strong>
\nJournal of Mathematical Modelling and Algorithms<\/em>, Vol. 1, Num. 1, pp. 57-85, 2002. PDF<\/a>
\nAbstract in Proc. 14th European Workshop in Computational Geometry<\/em>, pp. 83-86, 1998.<\/p>\n

\n

M. Abellanas, F. Hurtado, C. Ickling, R. Klein, E. Langetepe, L. MA, B. Palop, V. Sacrist\u00e1n.
\nSmallest Color-Spanning Objects<\/strong>
\nProc. 9th Annual European Symposium on Algorithms<\/em>, LNCS 2161, pp. 278-292, Springer-Verlag, 2001. PDF<\/a><\/p>\n

\n

M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacrist\u00e1n.
\nThe Farthest-Color Voronoi Diagram and Related Problems<\/strong>
\nExtended abstract in Proc. 17th European Workshop on Computational Geometry<\/em>, pp. 113-116, 2001.
\nExtended abstract (in spanish) in Actas de los IX Encuentros de Geometr\u00eda Computacional<\/em>, pp. 51-54, 2001.<\/p>\n

\n

M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacrist\u00e1n
\nProximity Problems for Time Metrics Induced by the L1-Metric and Isothetic Networks<\/strong>
\nExtended abstract in Actas de los IX Encuentros de Geometr\u00eda Computacional<\/em>, pp. 175-182, 2001. PDF<\/a><\/p>\n

\n

F.Hurtado, V.Sacrist\u00e1n, G.Toussaint.
\nSome Constrained Minimax and Maximin Location Problems<\/strong>
\nStudies in Locational Analysis<\/em>, 15, pp. 17-35, dec. 2000.\u00a0PDF<\/a>
\nPreliminary version in Proc. 10th Canadian Conference in Computational Geometry<\/em>, pp. 24-25, 1998.<\/p>\n

\n

F. Hurtado, B. Palop, V. Sacrist\u00e1n.
\nDiagramas de Voronoi con funciones temporales<\/strong>
\nActas de los VIII Encuentros de Geometr\u00eda Computacional<\/em> (in Spanish), pp. 279-287, 1999. PDF<\/a><\/p>\n

\n

E.Arkin, Y.J.Chiang, M. Held, J.Mitchell, V.Sacrist\u00e1n, S.Skiena, T.C. Yang.
\nOn Minimum-Area Hulls<\/strong>
\nAlgorithmica<\/em>, Vol. 21, pp. 119-136, 1998. PDF<\/a>
\nPreliminary version in Proc. 4th Annual European Symposium on Algorithms<\/em>, LNCS 1136, pp. 334-348, 1996. Link<\/a><\/p>\n

\n

V. Sacrist\u00e1n.
\nLower bounds for some geometric problems<\/strong>
\nTechnical Report MA-IR-98-0034, Universitat Polit\u00e8cnica de Catalunya, Departament de Matem\u00e0tica Aplicada II, 1998. PDF<\/a>
\nAbstract in Actas VIII Encuentros de Geometr\u00eda Computacional<\/em>, pp. 371-372, 1999.<\/p>\n

\n

F. Hurtado, V. Sacrist\u00e1n and G. Toussaint.
\nPruning can solve from Facility Location to Visibility Problems<\/strong>
\nProc. Journ\u00e9es Francoespagnoles de G\u00e9om\u00e9trie Algoritmique<\/em>, pp. 53-61, 1997. PDF<\/a><\/p>\n

\n

F. Hurtado, V. Sacrist\u00e1n and G. Toussaint.
\n\u00c1ngulo de apertura en la visi\u00f3n en dos y tres dimensiones<\/strong>
\nActas VII Encuentros de Geometr\u00eda Computacional<\/em>, pp. 15-28, 1997. PDF<\/a><\/p>\n

\n

V. Sacrist\u00e1n.
\nGeometric Optimization and Applications in Visibility<\/strong>
\nMy Phd. Thesis (in spanish) was supervised by Ferran Hurtado (1997).
\nContents:<\/strong>
\n1. Introduction
\n2. Quality images
\n3. Visibility by reflection
\n4. Optimization with linear programming and median finding.
\n5. Optimization of the angle of aperture and vision through obstacles.
\n6. References
\nPDF<\/a><\/p>\n

\n

G. Blanco, J. Garc\u00eda, F. Hurtado, P. Ramos and V. Sacrist\u00e1n.
\nIncidence angle constrained visibility<\/strong>
\nProc. 12th European Workshop on Computational Geometry<\/em>, pp. 27-28, 1996. PDF<\/a>
\nPreliminary version (in spanish): Fotograf\u00edas de Calidad<\/strong>, Actas VI Encuentros de Geometr\u00eda Computacional<\/em>, pp. 93-101, 1995.<\/p>\n","protected":false},"excerpt":{"rendered":"

G. Esteban, D. Halperin, V. Ru\u00edz, V. Sacrist\u00e1n and R.I. Silveira Shortest coordinated motion for a pair of square robots In: Abstracts 39th Spanish Meeting on Computational Geometry, Barcelona (Spain), March 29-31, pp. 21:1-21:8, 2023. Link Preliminary version: D. Halperin, V. Ruiz, V. Sacrist\u00e1n, R. Silveira, Optimal coordinate motions for two squares, Abstracts of the…<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":78,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-92","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/pages\/92","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/comments?post=92"}],"version-history":[{"count":155,"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/pages\/92\/revisions"}],"predecessor-version":[{"id":1967,"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/pages\/92\/revisions\/1967"}],"up":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/pages\/78"}],"wp:attachment":[{"href":"https:\/\/dccg.upc.edu\/people\/vera\/wp-json\/wp\/v2\/media?parent=92"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}