𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the second annual symposium - Yorktown Heights, New York, United States (1986.06.02-1986.06.04)] Proceedings of the second annual symposium on Computational geometry - SCG '86 - Worst-case optimal algorithms for constructing visibility polygons with holes

✍ Scribed by Suri, S; O'Rourke, J

Book ID
120821435
Publisher
ACM Press
Year
1986
Weight
596 KB
Category
Article
ISBN-13
9780897911948

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the second annual symposium -
[ACM Press the second annual symposium - Yorktown Heights, New York, United States (1986.06.02-1986.06.04)] Proceedings of the second annual symposium on Computational geometry - SCG '86 - Worst-case optimal algorithms for constructing visibility polygons with holes
✍ Suri, S; O'Rourke, J πŸ“‚ Article πŸ“… 1986 πŸ› ACM Press βš– 596 KB

EIGindy and Avis [EA] considered the problem of determining the visibility polygon from a point inside a polygon. Their algorithm runs in optimal O(n ) time and space, where n is the number of the vertices of the given polygon. Later their result was generalized to visibility polygons from an edge b

[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