Rodrigo I. Silveira

MaRDI QIDQ396474zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The farthest color Voronoi diagram in the plane Algorithmica	2025-09-08	Paper
Efficient Fréchet distance queries for segments	2025-06-19	Paper
Shortest paths in portalgons Journal of Computational Geometry	2025-04-23	Paper
Shortest paths in portalgons	2024-10-16	Paper
Computing largest minimum color-spanning intervals of imprecise points	2024-05-31	Paper
Shortest coordinated motion for square robots Lecture Notes in Computer Science	2024-01-16	Paper
On approximating shortest paths in weighted triangular tessellations Artificial Intelligence	2023-06-27	Paper
Continuous mean distance of a weighted graph Results in Mathematics	2023-05-26	Paper
Flips in higher order Delaunay triangulations	2022-10-13	Paper
Farthest color Voronoi diagrams: complexity and algorithms	2022-10-13	Paper
scientific article; zbMATH DE number 7561369 (Why is no real title available?)	2022-07-21	Paper
On approximating shortest paths in weighted triangular tessellations (available as arXiv preprint)	2022-07-13	Paper
Affine invariant triangulations Computer Aided Geometric Design	2022-01-12	Paper
Affine invariant triangulations Computer Aided Geometric Design	2022-01-12	Paper
New production matrices for geometric graphs Linear Algebra and its Applications	2021-11-23	Paper
Hamiltonicity for convex shape Delaunay and Gabriel graphs Computational Geometry	2020-10-23	Paper
Hamiltonicity for convex shape Delaunay and Gabriel graphs Lecture Notes in Computer Science	2020-01-16	Paper
A new lower bound on the maximum number of plane graphs using production matrices Computational Geometry	2019-10-25	Paper
Theoretical analysis of beaconless geocast protocols in 1D 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-18	Paper
Region-based approximation algorithms for visibility between imprecise locations 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
Non-crossing paths with geographic constraints Discrete Mathematics and Theoretical Computer Science. DMTCS	2019-08-01	Paper
Computing optimal shortcuts for networks European Journal of Operational Research	2019-07-03	Paper
Matching points with disks with a common intersection Discrete Mathematics	2019-06-18	Paper
Matching points with disks with a common intersection Discrete Mathematics	2019-06-18	Paper
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) Algorithmica	2019-05-21	Paper
Stabbing segments with rectilinear objects Applied Mathematics and Computation	2019-03-29	Paper
Non-crossing paths with geographic constraints Lecture Notes in Computer Science	2019-02-20	Paper
A note on flips in diagonal rectangulations (available as arXiv preprint)	2018-12-10	Paper
A note on flips in diagonal rectangulations	2018-12-10	Paper
On the complexity of barrier resilience for fat regions and bounded ply Computational Geometry	2018-10-31	Paper
On the complexity of barrier resilience for fat regions and bounded ply Computational Geometry	2018-10-31	Paper
On the complexity of barrier resilience for fat regions	2018-10-17	Paper
New results on production matrices for geometric graphs	2018-10-11	Paper
Colored spanning graphs for set visualization Computational Geometry	2018-02-19	Paper
Colored spanning graphs for set visualization Computational Geometry	2018-02-19	Paper
Colored ray configurations Computational Geometry	2018-02-19	Paper
Colored ray configurations Computational Geometry	2018-02-19	Paper
Characteristic polynomials of production matrices for geometric graphs	2018-01-18	Paper
Embedding rivers in polyhedral terrains Proceedings of the twenty-fifth annual symposium on Computational geometry	2017-10-20	Paper
Adjacency-preserving spatial treemaps	2017-03-30	Paper
Flow computations on imprecise terrains	2017-03-09	Paper
Production matrices for geometric graphs	2017-02-13	Paper
Space-time trade-offs for stack-based algorithms (available as arXiv preprint)	2017-01-30	Paper
Stabbing segments with rectilinear objects Lecture Notes in Computer Science	2015-09-29	Paper
Space-time trade-offs for stack-based algorithms Algorithmica	2015-09-02	Paper
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS International Journal of Computational Geometry & Applications	2015-07-01	Paper
Geometric biplane graphs. II: Graph augmentation Graphs and Combinatorics	2015-05-22	Paper
Geometric biplane graphs. I: Maximal graphs Graphs and Combinatorics	2015-05-22	Paper
Bichromatic 2-center of pairs of points Computational Geometry	2015-03-06	Paper
Cell-paths in mono- and bichromatic line arrangements in the plane	2015-02-09	Paper
Balanced partitions of 3-colored geometric sets in the plane Discrete Applied Mathematics	2014-12-05	Paper
New results on stabbing segments with a polygon Computational Geometry	2014-11-24	Paper
Computing a visibility polygon using few variables Computational Geometry	2014-08-13	Paper
Computing similarity between piecewise-linear functions Proceedings of the twenty-sixth annual symposium on Computational geometry	2014-04-03	Paper
Computing correlation between piecewise-linear functions SIAM Journal on Computing	2014-02-04	Paper
Terrain visibility with multiple viewpoints Algorithms and Computation	2014-01-14	Paper
Colored spanning graphs for set visualization Graph Drawing	2013-12-20	Paper
Median trajectories Algorithmica	2013-06-25	Paper
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION International Journal of Computational Geometry & Applications	2013-06-24	Paper
New results on stabbing segments with a polygon Lecture Notes in Computer Science	2013-06-07	Paper
Bichromatic 2-center of pairs of points LATIN 2012: Theoretical Informatics	2012-06-29	Paper
Removing local extrema from imprecise terrains Computational Geometry	2012-05-18	Paper
Drawing (complete) binary tanglegrams Algorithmica	2012-04-26	Paper
Computing the visibility polygon using few variables Algorithms and Computation	2011-12-16	Paper
Flow Computations on Imprecise Terrains Lecture Notes in Computer Science	2011-08-12	Paper
Flow Computations on Imprecise Terrains Lecture Notes in Computer Science	2011-08-12	Paper
Adjacency-preserving spatial treemaps Lecture Notes in Computer Science	2011-08-12	Paper
On the number of higher order Delaunay triangulations Theoretical Computer Science	2011-07-14	Paper
Peeling meshed potatoes Algorithmica	2011-05-10	Paper
Finding the most relevant fragments in networks Journal of Graph Algorithms and Applications	2011-02-16	Paper
SMOOTHING IMPRECISE 1.5D TERRAINS International Journal of Computational Geometry & Applications	2010-09-30	Paper
Median trajectories Algorithms – ESA 2010	2010-09-06	Paper
Flooding countries and destroying dams International Journal of Computational Geometry & Applications	2010-07-27	Paper
On the Number of Higher Order Delaunay Triangulations Lecture Notes in Computer Science	2010-05-28	Paper
Optimization for first order Delaunay triangulations Computational Geometry	2010-03-16	Paper
Planar bichromatic minimum spanning trees Journal of Discrete Algorithms	2009-12-10	Paper
Connect the Dot: Computing Feed-Links with Minimum Dilation Lecture Notes in Computer Science	2009-10-20	Paper
Optimal higher order Delaunay triangulations of polygons Computational Geometry	2009-06-30	Paper
Towards a definition of higher order constrained Delaunay triangulations Computational Geometry	2009-03-09	Paper
Drawing (Complete) Binary Tanglegrams Graph Drawing	2009-03-03	Paper
Optimization for First Order Delaunay Triangulations Lecture Notes in Computer Science	2009-02-17	Paper
Flooding Countries and Destroying Dams Lecture Notes in Computer Science	2009-02-17	Paper
Smoothing Imprecise 1.5D Terrains Approximation and Online Algorithms	2009-02-12	Paper
Optimal Higher Order Delaunay Triangulations of Polygons Lecture Notes in Computer Science	2008-04-15	Paper

Research outcomes over time

This page was built for person: Rodrigo I. Silveira