Constructing plane spanners of bounded degree and low weight
From MaRDI portal
Publication:818655
DOI10.1007/s00453-005-1168-8zbMath1086.68136MaRDI QIDQ818655
Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1168-8
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Minimum weight convex Steiner partitions, On the stretch factor of Delaunay triangulations of points in convex position, Low-light trees, and tight lower bounds for Euclidean spanners, Light orthogonal networks with constant geometric dilation, DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE