𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the tenth annual symposium - Stony Brook, New York, United States (1994.06.06-1994.06.08)] Proceedings of the tenth annual symposium on Computational geometry - SCG '94 - A fast algorithm for constructing sparse Euclidean spanners

✍ Scribed by Das, Gautam; Narasimhan, Giri

Book ID
120791257
Publisher
ACM Press
Year
1994
Weight
689 KB
Category
Article
ISBN-13
9780897916486

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the tenth annual symposium -
[ACM Press the tenth annual symposium - Stony Brook, New York, United States (1994.06.06-1994.06.08)] Proceedings of the tenth annual symposium on Computational geometry - SCG '94 - A fast algorithm for constructing sparse Euclidean spanners
✍ Das, Gautam; Narasimhan, Giri πŸ“‚ Article πŸ“… 1994 πŸ› ACM Press βš– 689 KB

Gautam Das q t Giri Narasimhanà bstract Let G = (V, 1?) be a n-vertex connected graph with positive edge weights. A subgraph G' is a t-spanner if for all u, v c V, the distance between u and v in the subgraph is at most t times the corresponding distance in G. We design an O(n log2 n) time algorithm

[ACM Press the fourth annual symposium -
[ACM Press the fourth annual symposium - Urbana-Champaign, Illinois, United States (1988.06.06-1988.06.08)] Proceedings of the fourth annual symposium on Computational geometry - SCG '88 - Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
✍ Kapoor, S.; Maheshwari, S. N. πŸ“‚ Article πŸ“… 1988 πŸ› ACM Press βš– 773 KB

The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles is studied. An O( m 2 logn + nlogn ) algorithm is developed, where n is the total number of points in the obstacles. A simple O(E+T) algorithm for determining the visibility gra