Untangled monotonic chains and adaptive range search
DOI10.1016/J.TCS.2011.01.037zbMATH Open1221.68069OpenAlexW3146418440MaRDI QIDQ553358FDOQ553358
Authors: Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro Lopez-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala 
Publication date: 27 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.037
Recommendations
computational geometrydata structureimplicitrange queryadaptivemonotonic chainrange searchuntangling
Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- On minimum \(k\)-modal partitions of permutations
- Orthogonal range searching in linear and almost-linear space
- Fractional cascading. I: A data structuring technique
- Approximating minimum cocolorings.
- Implicit data structures for fast search and update
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
- Partitioning a sequence into few monotone subsequences
- Title not available (Why is that?)
- Untangled monotonic chains and adaptive range search
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
Cited In (4)
This page was built for publication: Untangled monotonic chains and adaptive range search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553358)
