๐”– 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 - A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

โœ Scribed by Dwyer, R A

Book ID
118024794
Publisher
ACM Press
Year
1986
Weight
747 KB
Volume
0
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