1 research outputs found
Polygon Queries for Convex Hulls of Points
We study the following range searching problem: Preprocess a set of
points in the plane with respect to a set of orientations % ,
for a constant, in the plane so that given an -oriented convex
polygon , the convex hull of can be computed efficiently, where an
-oriented polygon is a polygon whose edges have orientations in
. We present a data structure with space and
construction time, and an -time query
algorithm for any query -oriented convex -gon , where is
the complexity of the convex hull.
Also, we can compute the perimeter or area of the convex hull of in
time using the data structure