Point enclosure problem for homothetic polygons
From MaRDI portal
Publication:6182886
DOI10.1007/978-3-031-34347-6_2arXiv2112.01860MaRDI QIDQ6182886
Publication date: 22 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.01860
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear space data structures for two types of range search
- Dynamic fractional cascading
- Storing line segments in partition trees
- Dominance made simple
- Fractional cascading. I: A data structuring technique
- Triangulating a simple polygon in linear time
- On \(k\)-sets in arrangements of curves and surfaces
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Algorithms for three-dimensional dominance searching in linear space.
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Filtering Search: A New Approach to Query-Answering
- Algorithms for ray-shooting and intersection searching
- New upper bounds for generalized intersection searching problems
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- On point covers of \(c-\)oriented polygons
This page was built for publication: Point enclosure problem for homothetic polygons