Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12145
- Type
- D - Journal article
- DOI
-
10.1007/s00453-017-0376-3
- Title of journal
- Algorithmica: an international journal in computer science
- Article number
- 11
- First page
- 3192
- Volume
- 80
- Issue
- 11
- ISSN
- 0178-4617
- Open access status
- Technical exception
- Month of publication
- September
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper appeared at SODA'14. It is the state-of-the-art in static orthogonal range reporting for dimensions 3 and above, as evidenced by the discussion in the Handbook on Discrete & Computational Geometry (2017, chapter "Range Searching") and "A Journey Through Discrete Mathematics" (2017, chapter "Approximating the k-Level in Three-Dimensional Plane Arrangements"). The techniques have been used by the authors, for example, for rectangle enclosure (Afshani et al, ICALP'14, not REF returned) and others, for example, for orthogonal point enclosure queries by Saladi Rahul (MOR'20) and for hypervolume subset selection by Groz and Maniu (Evol.Comput'19).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -