Items related to Cascading Divide-and-Conquer (Classic Reprint): A Technique...

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

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

This specific ISBN edition is currently not available.

Synopsis

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).

"synopsis" may belong to another edition of this title.

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want