Rodrigo I. Silveira

Orcid: 0000-0003-0202-4543

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Rodrigo I. Silveira authored at least 90 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The Farthest Color Voronoi Diagram in the Plane.
Algorithmica, October, 2025

Shortest coordinated motions for square robots.
Auton. Robots, June, 2025

Roadster: Improved algorithms for subtrajectory clustering and map construction.
Comput. Geosci., 2025

Algorithms for Distance Problems in Continuous Graphs.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

On Geodesic Disks Enclosing Many Points.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

2024
Graph Sampling for Map Comparison.
ACM Trans. Spatial Algorithms Syst., September, 2024

Approximating shortest paths in weighted square and hexagonal meshes.
CoRR, 2024

Computing Largest Minimum Color-Spanning Intervals of Imprecise Points.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Exact solutions to the Weighted Region Problem.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

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

Shortest Paths in Portalgons.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
On Approximating Shortest Paths in Weighted Triangular Tessellations.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
A scalable method to construct compact road networks from GPS trajectories.
Int. J. Geogr. Inf. Sci., 2021

Continuous mean distance of a weighted graph.
CoRR, 2021

Terrain prickliness: theoretical grounds for low complexity viewsheds.
CoRR, 2021

Affine invariant triangulations.
Comput. Aided Geom. Des., 2021

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

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

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

New production matrices for geometric graphs.
CoRR, 2020

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

Flips in Higher Order Delaunay Triangulations.
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

2019
Matching points with disks with a common intersection.
Discret. Math., 2019

A new lower bound on the maximum number of plane graphs using production matrices.
Comput. Geom., 2019

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).
Algorithmica, 2019

Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Ane invariant triangulations.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
New results on production matrices for geometric graphs.
Electron. Notes Discret. Math., 2018

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

On the complexity of barrier resilience for fat regions and bounded ply.
Comput. Geom., 2018

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

Computing Optimal Shortcuts for Networks.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

2017
Characteristic polynomials of production matrices for geometric graphs.
Electron. Notes Discret. Math., 2017

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

Non-crossing Paths with Geographic Constraints.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Production matrices for geometric graphs.
Electron. Notes Discret. Math., 2016

Space-Efficient Hidden Surface Removal.
CoRR, 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

Implementing data-dependent triangulations with higher order Delaunay triangulations.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

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

2015
Geometric Biplane Graphs II: Graph Augmentation.
Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.
Discret. Appl. Math., 2015

Stabbing Segments with Rectilinear Objects.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci., 2014

Colored Ray Configurations.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computing Correlation between Piecewise-Linear Functions.
SIAM J. Comput., 2013

Space-Time Trade-offs for Stack-Based Algorithms.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Terrain Visibility with Multiple Viewpoints.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

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

New Results on Stabbing Segments with a Polygon.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Convex hull alignment through translation.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Complexity of Barrier Resilience for Fat Regions.
Proceedings of the Algorithms for Sensor Systems, 2013

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

Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

Removing local extrema from imprecise terrains.
Comput. Geom., 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012

Bichromatic 2-Center of Pairs of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Embedding rivers in triangulated irregular networks with linear programming.
Int. J. Geogr. Inf. Sci., 2011

Peeling Meshed Potatoes.
Algorithmica, 2011

Flow Computations on Imprecise Terrains.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Adjacency-Preserving Spatial Treemaps.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Computing the Visibility Polygon Using Few Variables.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010


10491 Results of the break-out group: Similarity measures.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Computing similarity between piecewise-linear functions.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

On the Number of Higher Order Delaunay Triangulations.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Optimization of polyhedral terrains.
PhD thesis, 2009

Planar bichromatic minimum spanning trees.
J. Discrete Algorithms, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Embedding rivers in polyhedral terrains.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Minimizing Slope Change in Imprecise 1.5D terrains.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Smoothing Imprecise 1.5D Terrains.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Optimal Higher Order Delaunay Triangulations of Polygons.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Drawing (Complete) Binary Tanglegrams.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Flooding Countries and Destroying Dams.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Optimization for First Order Delaunay Triangulations.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Towards a Definition of Higher Order Constrained Delaunay Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Largest Subsets of Triangles in a Triangulation.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007


  Loading...