A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS
2012
International journal of computational geometry and applications
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the convex hull intersecting a query line, with expected query and amortized update time O(log 1+ε n) for an arbitrarily small constant ε > 0. This improves the previous bound of O(log 3/2 n). • A fully dynamic data structure for maintaining a set of n points in the plane to support halfplane range reporting queries in O(log n
doi:10.1142/s0218195912600096
fatcat:wy6uszf7vjerffnijepg7jszga