activity
20202026
most citedOn approximating shortest paths in weighted triangular tessellations

3 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CG2026

Computational aspects of disks enclosing many points

Prosenjit Bose, Guillermo Esteban, Tyler Tuttle

Let be a set of points in the plane. We present several different algorithms for finding a pair of points in such that any disk that contains that pair must contain at…

cs.CG2025

On geodesic disks enclosing many points

Prosenjit Bose, Guillermo Esteban, David Orden +2

Let be the largest number such that for every set of points in a polygon~, there always exist two points , where every geodesic disk contain…

cs.CG2024

Computing shortest paths amid non-overlapping weighted disks

Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban +1

In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of non-overlapping weighted disks in the plane. For a given parame…

cs.CG2024

Approximating shortest paths in weighted square and hexagonal meshes

Prosenjit Bose, Guillermo Esteban, David Orden +1

Continuous 2-dimensional space is often discretized by considering a mesh of weighted cells. In this work we study how well a weighted mesh approximates the space, with respect to…

cs.CG2024

Exact solutions to the Weighted Region Problem

Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira +1

In this paper, we consider the Weighted Region Problem. In the Weighted Region Problem, the length of a path is defined as the sum of the weights of the subpaths within each region…

cs.CG2021★ 3 cited

On approximating shortest paths in weighted triangular tessellations

Prosenjit Bose, Guillermo Esteban, David Orden +1

We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessel…

math.CO2020

New production matrices for geometric graphs

Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira

We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulat…