Succinct and Implicit Data Structures for Computational Geometry
From MaRDI portal
Publication:2848977
Recommendations
- scientific article; zbMATH DE number 1424298
- Efficient structures for geometric data management
- Uniquely Represented Data Structures for Computational Geometry
- Towards in-place geometric algorithms and data structures
- Building efficient and compact data structures for simplicial complexes
- Building efficient and compact data structures for simplicial complexes
- Explicit Array-Based Compact Data Structures for Triangulations
- Dynamic geometric data structures via shallow cuttings
- scientific article; zbMATH DE number 7559224
- Geometric data structures for computer graphics.
Cites work
- scientific article; zbMATH DE number 1617249 (Why is no real title available?)
- scientific article; zbMATH DE number 4211552 (Why is no real title available?)
- scientific article; zbMATH DE number 5764826 (Why is no real title available?)
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1830754 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A space-efficient framework for dynamic point location
- Algorithms and Data Structures
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- An in-place min-max priority search tree
- Approximating minimum cocolorings.
- Compressed representations of sequences and full-text indexes
- Decomposable searching problems
- Dynamic range majority data structures
- Dynamic range selection in linear space
- Efficient partition trees
- Expected asymptotically optimal planar point location
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fully-functional succinct trees
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- Implicit Data Structures for the Dictionary Problem
- Improved data structures for the orthogonal range successor problem
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
- Multidimensional binary search trees used for associative searching
- New Results on Dynamic Planar Point Location
- On the Exact Worst Case Query Complexity of Planar Point Location
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Optimal partition trees
- Optimal worst-case operations for implicit cache-oblivious search trees.
- Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
- Orthogonal range searching on the RAM, revisited
- Partial match retrieval in implicit data structures
- Priority Search Trees
- Range searching with efficient hierarchical cuttings
- Rank and select revisited and extended
- Rank/select on dynamic compressed sequences and applications
- Reporting points in halfspaces
- Searching and storing similar lists
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Succinct Data Structures for Path Queries
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct Representations of Arbitrary Graphs
- Succinct geometric indexes supporting point location queries
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct indices for range queries with applications to orthogonal range maxima
- Succinct representation of balanced parentheses and static trees
- Succinct representation of labeled graphs
- Succinct representations of planar maps
- Towards in-place geometric algorithms and data structures
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Untangled monotonic chains and adaptive range search
Cited in
(13)- Encoding two-dimensional range top-\(k\) queries
- A space-efficient framework for dynamic point location
- Succinct data structures for approximating convex functions with applications
- Succinct color searching in one dimension
- Two approaches to building time-windowed geometric data structures
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Dynamic geometric data structures via shallow cuttings
- Explicit Array-Based Compact Data Structures for Triangulations
- Towards in-place geometric algorithms and data structures
- Speeding up the incremental construction of the union of geometric objects in practice.
- Succinct geometric indexes supporting point location queries
- Succinct dynamic one-dimensional point reporting
- Succinct geometric indexes supporting point location queries
This page was built for publication: Succinct and Implicit Data Structures for Computational Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848977)
