Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Sacristán, Vera"'
Autor:
Akitaya, Hugo A., Demaine, Erik D., Gonczi, Andrei, Hendrickson, Dylan H., Hesterberg, Adam, Korman, Matias, Korten, Oliver, Lynch, Jayson, Parada, Irene, Sacristán, Vera
We give both efficient algorithms and hardness results for reconfiguring between two connected configurations of modules in the hexagonal grid. The reconfiguration moves that we consider are "pivots", where a hexagonal module rotates around a vertex
Externí odkaz:
http://arxiv.org/abs/2012.07556
Autor:
Akitaya, Hugo A., Arkin, Esther M., Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Korman, Matias, Palop, Belén, Parada, Irene, van Renssen, André, Sacristán, Vera
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precisely, we show that five extra "helper" modules ("musketeers") suffice to
Externí odkaz:
http://arxiv.org/abs/1908.07880
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 20 no. 2, Combinatorics (November 9, 2018) dmtcs:4315
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal with local
Externí odkaz:
http://arxiv.org/abs/1712.07919
Autor:
Hurtado, Ferran, Korman, Matias, van Kreveld, Marc, Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, Tokuyama, Takeshi
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong ex
Externí odkaz:
http://arxiv.org/abs/1603.00580
Autor:
Binucci, Carla, Di Giacomo, Emilio, Hong, Seok-Hee, Liotta, Giuseppe, Meijer, Henk, Sacristán, Vera, Wismath, Stephen
Publikováno v:
In Computational Geometry: Theory and Applications August 2020 89
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hurtado, Ferran, Löffler, Maarten, Matos, Inês, Sacristán, Vera, Saumell, Maria, Silveira, Rodrigo I., Staals, Frank
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with $m>1$ viewpoints (or guards) located on the terrain surface. A point on the terrain is considered \emph{visible}
Externí odkaz:
http://arxiv.org/abs/1309.4323
Autor:
Aichholzer, Oswin, Hackl, Thomas, Pilz, Alexander, Ramos, Pedro A., Sacristán, Vera, Vogtenhuber, Birgit
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In
Externí odkaz:
http://arxiv.org/abs/1306.5081
Autor:
Aloupis, Greg, Collette, Sebastien, Demaine, Erik D., Langerman, Stefan, Sacristan, Vera, Wuhrer, Stefanie
We consider the theoretical model of Crystalline robots, which have been introduced and prototyped by the robotics community. These robots consist of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/de
Externí odkaz:
http://arxiv.org/abs/0908.2440
Autor:
Hurtado, Ferran, Korman, Matias, van Kreveld, Marc, Löffler, Maarten, Sacristán, Vera, Shioura, Akiyoshi, Silveira, Rodrigo I., Speckmann, Bettina, Tokuyama, Takeshi
Publikováno v:
In Computational Geometry: Theory and Applications March 2018 68:262-276