Succinct and Implicit Data Structures for Computational Geometry

DOI10.1007/978-3-642-40273-9_15zbMATH Open1394.68097OpenAlexW180217369MaRDI QIDQ2848977FDOQ2848977

Authors: Meng He 

Publication date: 13 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_15

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.

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Efficient partition trees
• Succinct representation of balanced parentheses and static trees
• Succinct Data Structures for Path Queries
• Compressed representations of sequences and full-text indexes
• Title not available (Why is that?)
• Fully-functional succinct trees
• Succinct indexes for strings, binary relations and multilabeled trees
• Expected asymptotically optimal planar point location
• Optimal Search in Planar Subdivisions
• Priority Search Trees
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Orthogonal range searching on the RAM, revisited
• Decomposable searching problems
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Succinct indices for range queries with applications to orthogonal range maxima
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Optimal Point Location in a Monotone Subdivision
• Multidimensional binary search trees used for associative searching
• Title not available (Why is that?)
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Rank/select on dynamic compressed sequences and applications
• Dynamic range majority data structures
• Dynamic range selection in linear space
• Improved data structures for the orthogonal range successor problem
• On the Exact Worst Case Query Complexity of Planar Point Location
• Optimal partition trees
• Succinct representation of labeled graphs
• Rank and select revisited and extended
• Title not available (Why is that?)
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• Towards in-place geometric algorithms and data structures
• Approximating minimum cocolorings.
• Succinct Representations of Arbitrary Graphs
• Untangled monotonic chains and adaptive range search
• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• Algorithms and Data Structures
• Succinct representations of planar maps
• Reporting points in halfspaces
• Optimal worst-case operations for implicit cache-oblivious search trees.
• Range searching with efficient hierarchical cuttings
• Title not available (Why is that?)
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
• New Results on Dynamic Planar Point Location
• Title not available (Why is that?)
• Succinct geometric indexes supporting point location queries
• Implicit Data Structures for the Dictionary Problem
• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
• Partial match retrieval in implicit data structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• A space-efficient framework for dynamic point location
• Searching and storing similar lists
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• An in-place min-max priority search tree

Cited In (13)

• Two approaches to building time-windowed geometric data structures
• Dynamic geometric data structures via shallow cuttings
• Speeding up the incremental construction of the union of geometric objects in practice.
• Title not available (Why is that?)
• Succinct geometric indexes supporting point location queries
• Succinct dynamic one-dimensional point reporting
• Encoding two-dimensional range top-\(k\) queries
• Succinct geometric indexes supporting point location queries
• Succinct data structures for approximating convex functions with applications
• Explicit Array-Based Compact Data Structures for Triangulations
• A space-efficient framework for dynamic point location
• Succinct color searching in one dimension
• Towards in-place geometric algorithms and data structures

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)