World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING

    https://doi.org/10.1142/S0218195907002379Cited by:0 (Source: Crossref)

    Given two sets A and B of m non-crossing line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) storage and supports the following query in O(log m) time: Given a parabola γ : y = ax2 + bx + c, does γ separate A and B? This structure can be used to build a data structure that stores a simple polygon and allows ray-shooting queries along parabolic trajectories with vertical main axis. For a polygon of complexity n, we can answer such "stone-throwing" queries in O(log2 n) time, using O(n log n) storage and O(n log2 n) preprocessing time. This matches the best known bound for circular ray shooting in simple polygons.

    This research was supported by the French-Korean Science and Technology Amicable Relationships program (STAR).

    References

    Remember to check out the Most Cited Articles!

    Check out these titles in image analysis!