Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal network for a given set of n points in the plane is an axis-aligned planar straight line graph that connects all input points. We show that for any set of n points in the plane, there is an orthogonal network that (i) is short having a total edge length of O(|T|), where |T| denotes the length of a minimum Euclidean spanning tree for the point set; (ii) is small having O(n) vertices and edges; and (iii) has constant geometric dilation, which means that for any two points u and v in the network, the shortest path in the network between u and v is at most constant times longer than the (Euclidean) distance between u and v.
KeywordsSteiner Tree Narrow Channel Steiner Point Base Side Parallel Edge
Unable to display preview. Download preview PDF.
- 3.Arya, S., et al.: Euclidean spanners: short, thin, and lanky. In: Proc. 27th STOC, pp. 489–498. ACM Press, New York (1995)Google Scholar
- 7.Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol. 401, pp. 168–192. Springer, Heidelberg (1989)Google Scholar
- 8.Das, G., Narasimhan, G., Salowe, J.S.: A new way to weigh malnourished Euclidean graphs. In: Proc. 6th SODA, pp. 215–222. ACM Press, New York (1995)Google Scholar
- 17.MacGregor Smith, J., Winter, P.: Computing in Euclidean geometry. In: Computational geometry and topological network design, pp. 287–385. World Scientific, Singapore (1992)Google Scholar
- 18.Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)Google Scholar