Cited By
View all- Ezra ESharir M(2024)Intersection Searching amid Tetrahedra in Four DimensionsDiscrete & Computational Geometry10.1007/s00454-024-00656-8Online publication date: 3-Jun-2024
Semialgebraic range searching, arguably the most general version of range searching, is a fundamental problem in computational geometry. In the problem, we are to preprocess a set of n points in such that the subset of points inside a ...
In a typical range-emptiness searching (resp., reporting) problem, we are given a set $P$ of $n$ points in $\mathbb{R}^d$, and we wish to preprocess it into a data structure that supports efficient range-emptiness (resp., reporting) queries, in which we ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inView or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in Full Text.
Full TextView this article in HTML Format.
HTML Format