Abstract
We address a geometric problem called the segment dragging. We have n “obstacles” in the plane and want to preprocess them so that, given a query vertical line segment s, intersecting no obstacles, the first obstacle hit by s when we drag s horizontally to the right can be found efficiently. We present an O(log n) time, O( n) processor parallel algorithm for preprocessing when the obstacles are points or nonintersecting line segments. After preprocessing, a query can be answered in O(log n) time using a single processor. Our model of parallel computation is the EREW PRAM.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
