Vera Sacristán Adinolfi

Orcid: 0000-0003-0203-256X

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Vera Sacristán Adinolfi authored at least 50 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Shortest Coordinated Motion for Square Robots.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2021
A new meta-module design for efficient reconfiguration of modular robots.
Auton. Robots, 2021

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
Algorithmica, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Map construction algorithms: a local evaluation through hiking data.
GeoInformatica, 2020

Colored anchored visibility representations in 2D and 3D space.
Comput. Geom., 2020

Farthest Color Voronoi Diagrams: Complexity and Algorithms.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

2018
A Note on Flips in Diagonal Rectangulations.
Discret. Math. Theor. Comput. Sci., 2018

Colored spanning graphs for set visualization.
Comput. Geom., 2018

Theoretical analysis of beaconless geocast protocols in 1D.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Clustering Trajectories for Map Construction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

2016
A new meta-module for efficient reconfiguration of hinged-units modular robots.
Proceedings of the 2016 IEEE International Conference on Robotics and Automation, 2016

Map construction algorithms: an evaluation through hiking data.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, 2016

2015
Empty Triangles in Good Drawings of the Complete Graph.
Graphs Comb., 2015

Distributed reconfiguration of 2D lattice-based modular robotic systems.
Auton. Robots, 2015

2014
Terrain Visibility with Multiple Viewpoints.
Int. J. Comput. Geom. Appl., 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Measuring regularity of convex polygons.
Comput. Aided Des., 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

Improving Shortest Paths in the Delaunay Triangulation.
Int. J. Comput. Geom. Appl., 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

Segmenting trajectories: A framework and algorithms using spatiotemporal criteria.
J. Spatial Inf. Sci., 2011

On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

2010
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves
CoRR, 2009

Linear reconfiguration of cube-style modular robots.
Comput. Geom., 2009

2008
Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2004
The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom., 2004

Visualizing Objects with Mirrors.
Comput. Graph. Forum, 2004

Small Strictly Convex Quadrilateral Meshes of Point Sets.
Algorithmica, 2004

2003
Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett., 2003

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction.
Int. J. Comput. Geom. Appl., 2003

Long proteins with unique optimal foldings in the H-P model.
Comput. Geom., 2003

2002
Implicit Convex Polygons.
J. Math. Model. Algorithms, 2002

Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms, 2002

Splitting a Delaunay Triangulation in Linear Time.
Algorithmica, 2002

2001
On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Small Convex Quadrangulations of Point Sets.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Smallest Color-Spanning Objects.
Proceedings of the Algorithms, 2001

1998
On Minimum-Area Hulls.
Algorithmica, 1998

Constrainted facility location.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996
On Minimum-Area Hulls (Extended Abstract).
Proceedings of the Algorithms, 1996

1988
Development of Algebraic Specifications with Constraints.
Proceedings of the Categorial Methods in Computer Science: With Aspects from Topology [Workshop, 1988


  Loading...