Two-dimensional range diameter queries

DOI10.1007/978-3-642-29344-3_19MaRDI QIDQ2894467zbMATH OpenOpenAlexFDO

Authors Pooya Davoodi, Freek Van Walderveen, Michiel Smid

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://ir.library.carleton.ca/pub/6109

Mathematics Subject Classification ID

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

Recommendations

• Data structures for range-aggregate extent queries
• Lower Bounds for Geometric Diameter Problems
• On the difficulty of range searching
• On the difficulty of range searching.
• Concurrent range reporting in two-dimensional space

Cited in

(8)

• Range-max queries on uncertain data
• Finding pairwise intersections inside a query range
• Range search on tuples of points
• Two-Dimensional Range Minimum Queries
• Orthogonal vectors indexing
• Towards optimal set-disjointness and set-intersection data structures
• Range (Rényi) entropy queries and partitioning
• Range entropy queries and partitioning

This page was built for publication: Two-dimensional range diameter queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894467)