Back to Search
Start Over
Partial Enclosure Range Searching.
- Source :
- International Journal of Computational Geometry & Applications; Mar2019, Vol. 29 Issue 1, p73-93, 21p
- Publication Year :
- 2019
-
Abstract
- A new type of range searching problem, called the partial enclosure range searching problem, is introduced in this paper. Given a set of geometric objects S and a query region Q , our goal is to identify those objects in S which intersect the query region Q by at least a fixed proportion of their original size. Two variations of this problem are studied. In the first variation, the objects in S are axis-parallel line segments and the goal is to count the total number of members of S so that their intersection with Q is at least a given proportion of their size. Here, Q can be an axis-parallel rectangle or a parallelogram of arbitrary orientation. In the second variation, S is a polygon and Q is an axis-parallel rectangle. The problem is to report the area of the intersection between the polygon S and a query rectangle Q. [ABSTRACT FROM AUTHOR]
- Subjects :
- POLYGONS
PARALLELOGRAMS
COMPUTATIONAL geometry
RECTANGLES
Subjects
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 29
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 138145563
- Full Text :
- https://doi.org/10.1142/S0218195919500018