Cover Image

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bose, Prosenjit, De Carufel, Jean-Lou, Stuart, John
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

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

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

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

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

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

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

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)

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

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

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

External Incremental Delaunay Triangulation
by: Cai, Yifeng
Published: (2025)

Delaunay-Rips filtration: a study and an algorithm
by: Clémot, Mattéo, et al.
Published: (2025)

Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)

Drawings of Complete Multipartite Graphs Up to Triangle Flips
by: Aichholzer, Oswin, et al.
Published: (2023)

Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
by: Dubois, Loïc
Published: (2026)

Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning
by: Thacher, Will, et al.
Published: (2025)

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
by: Klost, Katharina, et al.
Published: (2024)

Simplicial approximation to CW complexes with spherical Delaunay triangulations
by: Tinarrage, Raphaël
Published: (2021)

Optimally Covering Large Triangles with Homothetic Unit Triangles
by: Boyer, John M.
Published: (2026)

(Semi-)Invariant Curves from Centers of Triangle Families
by: Mundilova, Klara, et al.
Published: (2026)

Order-2 Delaunay Triangulations Optimize Angles
by: Edelsbrunner, Herbert, et al.
Published: (2023)

On Triangles in Colored Pseudoline Arrangements
by: Radtke, Yan Alves, et al.
Published: (2026)

Minimum Monotone Spanning Trees
by: Di Giacomo, Emilio, et al.
Published: (2024)

Delaunay hypersurfaces in spheres
by: Zhang, Yongsheng
Published: (2024)

The_5th_Triangle
by: Cave, Scott Allen
Published: (2025)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
by: Duan, Hongyi, et al.
Published: (2025)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)

An Interface Tracking Method with Triangle Edge Cuts
by: Wang, Mengdi, et al.
Published: (2024)

Randomized HyperSteiner: A Stochastic Delaunay Triangulation Heuristic for the Hyperbolic Steiner Minimal Tree
by: Medbouhi, Aniss Aiman, et al.
Published: (2025)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
by: An, Shinwoo, et al.
Published: (2024)

Subtree Distances, Tight Spans and Diversities
by: Bryant, David, et al.
Published: (2025)

Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes
by: Li, Yue, et al.
Published: (2024)