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

[ACM Press the sixth annual symposium - Berkley, California, United States (1990.06.07-1990.06.09)] Proceedings of the sixth annual symposium on Computational geometry - SCG '90 - K -d trees for semidynamic point sets

โœ Scribed by Bentley, Jon Louis

Book ID
125527903
Publisher
ACM Press
Year
1990
Weight
907 KB
Category
Article
ISBN-13
9780897913621

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the sixth annual symposium -
[ACM Press the sixth annual symposium - Berkley, California, United States (1990.06.07-1990.06.09)] Proceedings of the sixth annual symposium on Computational geometry - SCG '90 - K -d trees for semidynamic point sets
โœ Bentley, Jon Louis ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› ACM Press โš– 907 KB

A K-d tree represents a set of N points in K-dimensional space. Operations on a semidynamic tree may delete and undelete points, but may not insert new points. 'ntis paper shows that several operations that require O(log N) expected time in general K-d trees may be performed in constant expected tim

[ACM Press the sixth annual symposium -
[ACM Press the sixth annual symposium - Berkley, California, United States (1990.06.07-1990.06.09)] Proceedings of the sixth annual symposium on Computational geometry - SCG '90 - Quasi-optimal upper bounds for simplex range searching and new zone theorems
โœ Chazelle, Bernard; Sharir, Micha; Welzl, Emo ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› ACM Press โš– 1007 KB

We consider the following problem, known as simplex range searching: Preprocess a set P of n points in ~d SO that, given any query simplex q, the points in P n q can be counted or r e p o r t e d efficiently. We can put the m a n y variants of this problem under the same umbrella by assuming a weigh