Cascading Divide-and-Conquer (Classic Reprint): A Technique for Designing Parallel Algorithms - Tapa blanda

Sinopsis

Excerpt from Cascading Divide-and-Conquer

Visibility from a Point: Given n line segments such that no two intersect (except possibly at endpoints) and a point p, determine that part of the plane visible from p if all the segments are opaque. A (log nlog log n,u) solution was given in We improve this to (log n,u).

"Sinopsis" puede pertenecer a otra edición de este libro.