Untangled monotonic chains and adaptive range search-Reference-Cited by-同舟云学术

Untangled monotonic chains and adaptive range search

Published:2011-07 Issue:32 Volume:412 Page:4200-4211
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Arroyuelo Diego,Claude Francisco,Dorrigiv Reza,Durocher Stephane,He Meng,López-Ortiz Alejandro,Ian Munro J.,Nicholson Patrick K.,Salinger Alejandro,Skala Matthew

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. The priority R-tree: a practically efficient and worst-case optimal R-tree;Arge;ACM Transactions on Algorithms,2008

2. Untangled monotonic chains and adaptive range search;Arroyuelo,2009

3. Partitioning a sequence into few monotone subsequences;Bar-Yehuda;Acta Informatica,1998

4. Multidimensional binary search trees used for associative searching;Bentley;Communications of the ACM,1975

5. An Ω(nlogn) lower bound for decomposing a set of points into chains;Bloniarz;Information Processing Letters,1989

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Succinct Quadtrees for Road Data;Similarity Search and Applications;2017

2. Linear space adaptive data structures for planar range reporting;Information Processing Letters;2016-05

3. On the compression of search trees;Information Processing & Management;2014-03

4. On compressing permutations and adaptive sorting;Theoretical Computer Science;2013-11

5. An Indexed K-D Tree for Neighborhood Generation in Swarm Robotics Simulation;Lecture Notes in Computer Science;2013