Rodrigo I. Silveira

Carola Wenk

ACM Trans. Spatial Algorithms Syst., September, 2024

Approximating shortest paths in weighted square and hexagonal meshes.

[BibT_eX]

[DOI]

CoRR, 2024

Exact solutions to the Weighted Region Problem.

[BibT_eX]

[DOI]

CoRR, 2024

Computing Largest Minimum Color-Spanning Intervals of Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

On approximating shortest paths in weighted triangular tessellations.

[BibT_eX]

[DOI]

Artif. Intell., May, 2023

Shortest Coordinated Motion for Square Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Shortest Paths in Portalgons.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Efficient Fréchet Distance Queries for Segments.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A scalable method to construct compact road networks from GPS trajectories.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2021

Continuous mean distance of a weighted graph.

[BibT_eX]

[DOI]

Delia Garijo

Alberto Márquez

CoRR, 2021

Terrain prickliness: theoretical grounds for low complexity viewsheds.

[BibT_eX]

[DOI]

CoRR, 2021

Affine invariant triangulations.

[BibT_eX]

[DOI]

Prosenjit Bose

Pilar Cano

Comput. Aided Geom. Des., 2021

A new meta-module design for efficient reconfiguration of modular robots.

[BibT_eX]

[DOI]

Irene Parada

Auton. Robots, 2021

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

2020

Map construction algorithms: a local evaluation through hiking data.

[BibT_eX]

[DOI]

David Duran

GeoInformatica, 2020

New production matrices for geometric graphs.

[BibT_eX]

[DOI]

Guillermo Esteban

Clemens Huemer

CoRR, 2020

Hamiltonicity for convex shape Delaunay and Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Farthest Color Voronoi Diagrams: Complexity and Algorithms.

[BibT_eX]

[DOI]

Ioannis Mantas

Evanthia Papadopoulou

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Flips in Higher Order Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Improved Map Construction using Subtrajectory Clustering.

[BibT_eX]

[DOI]

Erfan Hosseini Sereshgi

Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

2019

Computing optimal shortcuts for networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Non-crossing paths with geographic constraints.

[BibT_eX]

[DOI]

Bettina Speckmann

Kevin Verbeek

Discret. Math. Theor. Comput. Sci., 2019

Matching points with disks with a common intersection.

[BibT_eX]

[DOI]

Discret. Math., 2019

A new lower bound on the maximum number of plane graphs using production matrices.

[BibT_eX]

[DOI]

Clemens Huemer

Alexander Pilz

Comput. Geom., 2019

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

[BibT_eX]

[DOI]

Algorithmica, 2019

Ane invariant triangulations.

[BibT_eX]

Prosenjit Bose

Pilar Cano

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

New results on production matrices for geometric graphs.

[BibT_eX]

[DOI]

Guillermo Esteban

Clemens Huemer

Electron. Notes Discret. Math., 2018

A Note on Flips in Diagonal Rectangulations.

[BibT_eX]

[DOI]

Jean Cardinal

Discret. Math. Theor. Comput. Sci., 2018

Colored ray configurations.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

Alfredo García Olaverri

Comput. Geom., 2018

On the complexity of barrier resilience for fat regions and bounded ply.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Colored spanning graphs for set visualization.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Theoretical analysis of beaconless geocast protocols in 1D.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations.

[BibT_eX]

[DOI]

Natalia Rodríguez

ISPRS Int. J. Geo Inf., 2017

Characteristic polynomials of production matrices for geometric graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Stabbing segments with rectilinear objects.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

Clustering Trajectories for Map Construction.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

2016

Adjacency-preserving spatial treemaps.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Production matrices for geometric graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Space-Efficient Hidden Surface Removal.

[BibT_eX]

[DOI]

Frank Kammer

CoRR, 2016

A new meta-module for efficient reconfiguration of hinged-units modular robots.

[BibT_eX]

[DOI]

Irene Parada

Proceedings of the 2016 IEEE International Conference on Robotics and Automation, 2016

Map construction algorithms: an evaluation through hiking data.

[BibT_eX]

[DOI]

David Duran

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, 2016

2015

Geometric Biplane Graphs II: Graph Augmentation.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

New results on stabbing segments with a polygon.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

Comput. Geom., 2015

Bichromatic 2-center of pairs of points.

[BibT_eX]

[DOI]

Esther M. Arkin

José Miguel Díaz-Báñez

Ferran Hurtado

Piyush Kumar

Joseph S. B. Mitchell

Comput. Geom., 2015

Space-Time Trade-offs for Stack-Based Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2015

Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Terrain Visibility with Multiple Viewpoints.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Computing a visibility polygon using few variables.

[BibT_eX]

[DOI]

Comput. Geom., 2014

2013

Computing Correlation between Piecewise-Linear Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Flow computations on imprecise terrains.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Median Trajectories.

[BibT_eX]

[DOI]

Algorithmica, 2013

Colored Spanning Graphs for Set Visualization.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Gregorio Hernández-Peñalver

Bettina Speckmann

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Convex hull alignment through translation.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Complexity of Barrier Resilience for Fat Regions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Improving Shortest Paths in the Delaunay Triangulation.

[BibT_eX]

[DOI]

Manuel Abellanas

Mercè Claverol

Ferran Hurtado

Vera Sacristán Adinolfi

Maria Saumell

Int. J. Comput. Geom. Appl., 2012

Processing aggregated data: the location of clusters in health data.

[BibT_eX]

[DOI]

GeoInformatica, 2012

Removing local extrema from imprecise terrains.

[BibT_eX]

[DOI]

Comput. Geom., 2012

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

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

On the number of higher order Delaunay triangulations.

[BibT_eX]

[DOI]

Dieter Mitsche

Maria Saumell

Theor. Comput. Sci., 2011

Connect the dot: Computing feed-links for network extension.

[BibT_eX]

[DOI]

J. Spatial Inf. Sci., 2011

Embedding rivers in triangulated irregular networks with linear programming.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2011

Peeling Meshed Potatoes.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Finding the Most Relevant Fragments in Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Flooding Countries and Destroying dams.

[BibT_eX]

[DOI]

René van Oostrum

Int. J. Comput. Geom. Appl., 2010

Smoothing Imprecise 1.5D Terrains.

[BibT_eX]

[DOI]

Chris Gray

Int. J. Comput. Geom. Appl., 2010

Optimization for first order Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2010

10491 Results of the break-out group: Similarity measures.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Computing similarity between piecewise-linear functions.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Optimization of polyhedral terrains.

[BibT_eX]

[DOI]

PhD thesis, 2009

Planar bichromatic minimum spanning trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Optimal higher order Delaunay triangulations of polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Towards a definition of higher order constrained Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Embedding rivers in polyhedral terrains.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Minimizing Slope Change in Imprecise 1.5D terrains.

[BibT_eX]

[DOI]

Chris Gray