Cover Image

Approximating shortest paths in weighted square and hexagonal meshes

Fuente: arXiv

Saved in:

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

Similar Items

On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021)

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)

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

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

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)

Exact predicates, exact constructions and combinatorics for mesh CSG
by: Lévy, Bruno
Published: (2024)

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

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)

GPolylla: Fully GPU-accelerated polygonal mesh generator
by: Salinas-Fernández, Sergio, et al.
Published: (2024)

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)

Optimal Volume-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)

Warp-centric GPU meta-meshing and fast triangulation of billion-scale lattice structures
by: Zou, Qiang, 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)

Minimum-distortion continuous cartograms by numerically optimized meshes
by: Sargent, Robert C.
Published: (2024)

Optimal Area-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)

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)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

A note on optimal degree-three spanners of the square lattice
by: Galant, Damien, et al.
Published: (2020)

3D POLYLLA: Polyhedral meshing algorithm based on terminal-edge regions and terminal-face regions
by: Salinas-Fernández, Sergio, et al.
Published: (2023)

Quad layouts with high valence singularities for flexible quad meshing
by: Jezdimirović, Jovana, et al.
Published: (2021)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

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

Critical Point Extraction from Multivariate Functional Approximation
by: Ma, Guanqun, et al.
Published: (2024)

A simple and complete discrete exterior calculus on general polygonal meshes
by: Ptackova, Lenka, et al.
Published: (2024)