XIX Encuentros de Geometría Computacional - XIX EGC - EGC21 - EGC 21 - EGC2021 - EGC 2021

XIX Spanish Meeting on Computational Geometry                 

Libro de resúmenes

Libro de resúmenes

Listado de comunicaciones aceptadas

  • A discrete isoperimetric inequality. David Iglesias López, Eduardo Lucas Marín and Jesús Yepes Nicolás.
  • Algorithmic geometry with infinite time computation. Clemens Huemer, Moritz Müller, Carlos Seara and Adrián Tobar Nicolau.
  • Applications of geometric graphs to sensory analysis of cookies. David Orden, Encarnación Fernández-Fernández, Marino Tejedor-Romero and Alejandra Martı́nez-Moraian.
  • Bounds on the Diameter of Graph Associahedra. Jean Cardinal, Lionel Pournin and Mario Valencia-Pabon.
  • Computing the continuous mean distance for certain graph classes. Delia Garijo, Alberto Marquez and Rodrigo Silveira.
  • Computing the type cone of nestohedra. Arnau Padrol, Vincent Pilaud and Germain Poullot.
  • Crossing-optimal extension of simple drawings. Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada and Birgit Vogtenhuber.
  • Developable surfaces bounded by spline curves. Alicia Cantón, Leonardo Fernández-Jambrina, María Eugenia Rosado María and María Jesús Vázquez-Gallo.
  • Faster distance-based representative skyline in the plane. Sergio Cabello.
  • The edge labeling of higher order Voronoi diagrams. Mercè Claverol, Andrea de Las Heras Parrilla, Clemens Huemer and Alejandra Martínez-Moraian.
  • Minimum Color Spanning Circle in Imprecise Domain. Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Loffler and Maria Saumell.
  • New variants of perfect non-crossing matchings. Ioannis Mantas, Marko Savić and Hendrik Schrezenmaier.
  • No selection lemma for empty triangles. Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz and Birgit Vogtenhuber.
  • On (alpha,k)-sets and (alpha,k)-hulls in the plane. Mercè Claverol, Luis H. Herrera, Pablo Pérez-Lantero and Carlos Seara.
  • On Guillotine Cuts of Boundary Rectangles. Pablo Pérez-Lantero and Carlos Seara.
  • On Maximum-Sum Matchings of Points. Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero and Carlos Seara.
  • On prescribing total orders and preorders to pairwise distances of points in Euclidean space. Víctor Hugo Almendra-Hernández and Leonardo Martínez-Sandoval.
  • On the number of connected rectilinear convex 4-gons. Alejandra Martínez-Moraian and David Orden.
  • Parallel Simulated Annealing for Continuous Dispersion Problems. Narcis Coll and Marta Fort.
  • Pattern recognition of homogenized standard sets of image patterns arisen from Latin squares. Raúl Falcón.
  • Planar aesthetic curves. Alicia Cantón, Leonardo Fernández Jambrina and María Jesús Vázquez Gallo.
  • Plane paths in simple drawings of complete graphs. Oswin Aichholzer, Alfredo Garcia, Javier Tejel, Birgit Vogtenhuber and Alexandra Weinberger.
  • Shortest paths in weighted hexagonal tessellations. Guillermo Esteban, Prosenjit Bose, David Orden and Rodrigo Silveira.
  • Showing non-realizability of spheres by distilling a tree. Julian Pfeifle.
  • The Voronoi diagram of rotating rays with applications to floodlight illumination. Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savić, Hendrik Schrezenmaier, Carlos Seara and Martin Suderland.

Con el apoyo del Departamento de Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones, la Escuela Técnica Superior de Ingeniería de Sistemas Informáticos y la Universidad Politécnica de Madrid.

XIX Encuentros de Geometría Computacional