Degree four plane spanners: Simpler and better
From MaRDI portal
Publication:2970474
DOI10.20382/jocg.v8i2a2zbMath1405.68424arXiv1603.03818OpenAlexW2964200445MaRDI QIDQ2970474
Duru Türkoğlu, Ljubomir Perković, Iyad A. Kanj
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1603.03818
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (6)
Local routing in sparse and lightweight geometric graphs ⋮ On path-greedy geometric spanners ⋮ Emanation graph: a plane geometric spanner with Steiner points ⋮ Bounded-degree spanners in the presence of polygonal obstacle ⋮ On plane constrained bounded-degree spanners ⋮ A note on optimal degree-three spanners of the square lattice
This page was built for publication: Degree four plane spanners: Simpler and better
