Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
DOI10.1137/0218035zbMATH Open0677.68022DBLPjournals/siamcomp/AtallahCG89OpenAlexW2030999197WikidataQ56813835 ScholiaQ56813835MaRDI QIDQ3833604FDOQ3833604
Authors: Mikhail J. Atallah, Richard Cole, Michael T. Goodrich 
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1575&context=cstech
Recommendations
computational geometryparallel algorithmsvisibilitydominancedivide-and-conquerfractional cascadingintersection detectiontrapezoidal decompositionplanar point locationparallel data structures
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)
Cited In (50)
- Sorting signed permutations by reversals, revisited
- Testing a simple polygon for monotonicity optimally in parallel
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Planar stage graphs: Characterizations and applications
- A centroid labelling technique and its application to path selection in trees
- A data-parallel formulation for divide and conquer algorithms
- Parallel computational geometry
- Parallel computational geometry of rectangles
- The weighted maximum independent set problem in permutation graphs
- A fast Las Vegas algorithm for triangulating a simple polygon
- Optimal randomized parallel algorithms for computational geometry
- Divide and conquer: a granular concept-cognitive computing system for dynamic classification decision making
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Constructing arrangements optimally in parallel
- Geometric Knapsack problems
- Parallel methods for visibility and shortest-path problems in simple polygons
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- On parallel rectilinear obstacle-avoiding paths
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Rectangulating rectilinear polygons in parallel
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- Lower bounds for intersection searching and fractional cascading in higher dimension
- Title not available (Why is that?)
- On the multisearching problem for hypercubes
- On coding labeled trees
- Parallelization of divide-and-conquer in the Bird-Meertens formalism
- Sweep methods for parallel computational geometry
- Optimal cooperative search in fractional cascaded data structures
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
- Applications of a numbering scheme for polygonal obstacles in the plane
- Parallel algorithms for permutation graphs
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Parallel solutions to geometric problems in the scan model of computation
- Parallel construction of quadtrees and quality triangulations
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- Applications of a strategy for designing divide-and-conquer algorithms
- Parallel rectilinear shortest paths with rectangular obstacles
- Parallel general prefix computations with geometric, algebraic, and other applications
- Optimal parallel algorithms for point-set and polygon problems
- Line-segment intersection reporting in parallel
- Recursion and parallel algorithms in geometric modeling problems
- Parallel fractional cascading on hypercube multiprocessors
- Pipelines for Divide-and-Conquer Functions
- Constructing the Voronoi diagram of a set of line segments in parallel
- Massive parallelization of divide-and-conquer algorithms over powerlists
- Parallel algorithms for arrangements
This page was built for publication: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833604)
