A Framework for Computing the Greedy Spanner

DOI10.1145/2582112.2582154zbMath1401.68346OpenAlexW2116314660MaRDI QIDQ4635523

Quirijn W. Bouts, Kevin Buchin, Alex P. ten Brink

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/68b2e48e-95f4-4c68-96f8-a4e083f311ca

zbMATH Keywords

computational geometryspannerswell-separated pair decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (3)

Computing the greedy spanner in linear space ⋮ Distribution-sensitive construction of the greedy spanner ⋮ Measuring sample quality with diffusions

This page was built for publication: A Framework for Computing the Greedy Spanner