Excerpt from Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
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.
Excerpt from Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
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).
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 0,68 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332870325
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332870325
Cantidad disponible: 15 disponibles
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book presents a powerful technique called cascading divide-and-conquer, a set of efficient algorithms for solving geometric problems in parallel. It improves on existing methods by offering reduced time complexity for a wide range of problems, including segment intersection detection, trapezoidal decomposition, and planar point location. The book also introduces new techniques: fractional cascading, and plane sweep tree construction. It shows how to apply cascading divide-and-conquer to solve the challenging 3D maxima, 2-set dominance counting, and visibility from a point problems. All of the algorithms presented run in O (log n) time with either linear or sub-linear processors in the CREW PRAM model. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332870325_0
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 52 pages. 8.82x5.75x0.16 inches. This item is printed on demand. Nº de ref. del artículo: zk1332870325
Cantidad disponible: 1 disponibles