๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[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

โœ Scribed by Kapoor, S.; Maheshwari, S. N.

Book ID
120821444
Publisher
ACM Press
Year
1988
Weight
773 KB
Category
Article
ISBN-13
9780897912709

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[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

[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 - Optimal parallel algorithms for polygon and point-set problems
โœ Cole, R.; Goodrich, M. T. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› ACM Press โš– 954 KB

In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) \* P(n) products, where T(n) is the time complexity and P(n} is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, ou

[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