Cover Image

On approximating shortest paths in weighted triangular tessellations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bose, Prosenjit, Esteban, Guillermo, Orden, David, Silveira, Rodrigo I.
Format:	Preprint
Published:	2021
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

On geodesic disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2025)

Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

Linear time single-source shortest path algorithms in Euclidean graph classes
by: Gudmundsson, Joachim, et al.
Published: (2026)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)

Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
by: Löffler, Maarten, et al.
Published: (2024)

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
by: Alegría-Galicia, Carlos, et al.
Published: (2017)

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

On the complexity of covering points by guillotine cuts
by: Garijo, Delia, et al.
Published: (2026)

Optimizing generalized kernels of polygons
by: Martinez-Moraian, Alejandra, et al.
Published: (2018)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers
by: Orden, David, et al.
Published: (2020)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)

On polynomials associated to Voronoi diagrams of point sets and crossing numbers
by: Claverol, Mercè, et al.
Published: (2023)

Maximum rectilinear convex subsets
by: González-Aguilar, Hernán, et al.
Published: (2019)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
by: Colli, Giordano
Published: (2025)

Asymptotics of shortest filling closed multi-geodesics
by: Gao, Yue, et al.
Published: (2025)

Comparing hyperbolic and extremal lengths for shortest curves
by: Martínez-Granado, Dídac, et al.
Published: (2019)

Analysis of self-equilibrated networks through cellular modeling
by: Aloui, Omar, et al.
Published: (2020)

Theoretical analysis of beaconless geocast protocols in 1D
by: Gudmundsson, Joachim, et al.
Published: (2025)

A note on non-crossing path partitions in the plane
by: Tejel, Javier
Published: (2025)

Deforming the weighted-homogeneous foliation, and trivializing families of semi-weighted homogeneous ICIS
by: Kerner, Dmitry, et al.
Published: (2024)

A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
by: Gupta, Purvi, et al.
Published: (2024)

Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)

The dual of Philo's shortest line segment problem
by: Aliyev, Yagub N.
Published: (2024)

Computing braids from approximate data
by: Guillemot, Alexandre, et al.
Published: (2026)

Rainbow polygons for colored point sets in the plane
by: Flores-Peñaloza, David, et al.
Published: (2020)

Unavoidable patterns and plane paths in dense topological graphs
by: Keszegh, Balázs, et al.
Published: (2025)

Terrain prickliness: theoretical grounds for high complexity viewsheds
by: Acharyya, Ankush, et al.
Published: (2021)

Passage-traversing optimal path planning with sampling-based algorithms
by: Huang, Jing, et al.
Published: (2025)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation
by: Yi, Zeping, et al.
Published: (2026)