Parallel fractional cascading on hypercube multiprocessors

DOI10.1016/0925-7721(92)90005-DzbMath0772.68099MaRDI QIDQ1196294

Frank Dehne, Andrew Rau-Chaplin, Afonso G. Ferreira

Publication date: 16 December 1992

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

monotone graphsdata-structuring techniquemultiple slanted range searchmultiple stabbing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (3)

Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ On the multisearching problem for hypercubes ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• Parallel computational geometry
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Efficient piecewise-linear function approximation using the uniform metric
• Filtering Search: A New Approach to Query-Answering
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

This page was built for publication: Parallel fractional cascading on hypercube multiprocessors