Faster Planar Diameter using Pseudoline Envelopes
cs.DS, cs.CG
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- A Tight Bound for Facial Distance Patterns in Planar Graphs
- Distances in Planar Graphs are Almost for Free!
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time