scientific article
From MaRDI portal
Publication:4028874
zbMath0766.52004MaRDI QIDQ4028874
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Distance in graphs (05C12) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (13)
Beta-skeletons have unbounded dilation ⋮ Linear-size planar Manhattan network for convex point sets ⋮ Generating sparse spanners for weighted graphs ⋮ An exact algorithm for the minimum dilation triangulation problem ⋮ On the stretch factor of Delaunay triangulations of points in convex position ⋮ There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees ⋮ Dynamic proximity calculations for situation awareness ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains ⋮ Self-stabilizing metric graphs ⋮ Improved stretch factor of Delaunay triangulations of points in convex position ⋮ Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity ⋮ Affine invariant triangulations ⋮ Toughness and Delaunay triangulations
This page was built for publication:
