A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
International journal of computational geometry and applications
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real number γ with 0 < γ < π, we design an O(n)-time algorithm that constructs a connected subgraph G of G with vertex set V whose maximum degree is at most 14 + 2π/γ . If G is the Delaunay triangulation of V , and γ = 2π/3, we show that G is a t-spanner of V (for some constant t) with maximum degree at most 17, thereby improving the previously best known degree bound of 23. If G is a triangulationdoi:10.1142/s0218195909002861 fatcat:xoofjb4fejaa3g57mujddqavdq