What people are saying - Write a review
We haven't found any reviews in the usual places.
Robust Plane Sweep for Intersecting Segments
Binary Space Partitions for Fat Rectangles
The Topology of Public Knowledge
21 other sections not shown
Other editions - View all
algorithm apply assume belong biconnected c-node called changes cluster complete components Comput condition connected consider consists constant construction contains correct corresponding cost cuttings data structure defined definition deletion denote describe determine edge elements equal example exists fact failure finite formula function give given graph Hence holds implementation implies incident input insertion integer intersection least Lemma length linear lower bound maintain maximal memory neighbor node Note O(log obstacle obtain operation optimal otherwise output parallel partition path performed polynomial positive present probability problem procedure Proceedings processor projection Proof prove query quorum random rectangles relation remove represented root running satisfies schedule scheme segments sequence shared split step takes Theorem tree University update variables vertex vertices