Sweep methods for parallel computational geometry
type: Item
instance of: scholarly article
title: Sweep methods for parallel computational geometry
zbMATH Open document ID: 0840.68057
DOI: 10.1007/BF01941685
author: Yanyan Li
published in: Algorithmica
publication date: 1996-03-07T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 845918
zbMATH Keywords: computational geometry
zbMATH Keywords: parallel plane sweeping
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: Parallel computational geometry
cites work: Q3798228
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: Q3795217
cites work: Routing, merging, and sorting on parallel models of computation
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Fractional cascading. I: A data structuring technique
cites work: Q3942160
cites work: Parallel Merge Sort
cites work: Making data structures persistent
cites work: Q3772828
cites work: Stabbing line segments
cites work: Q3138885
cites work: Q4038727
cites work: An optimal contour algorithm for iso-oriented rectangles
cites work: Q3798226
cites work: Searching, Merging, and Sorting in Parallel Computation
cites work: Parallel Prefix Computation
cites work: Finding the contour of a union of iso-oriented rectangies
cites work: Q4038730
cites work: Hidden line elimination for isooriented rectangles
cites work: Finding the intersection of two convex polyhedra
cites work: Q3694703
cites work: Computation of the axial view of a set of isothetic parallelepipeds
cites work: An O(logn) parallel connectivity algorithm
cites work: Optimal algorithms to compute the closure of a set of iso-rectangles
cites work: Q4775467
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Parallelism in Comparison Problems
cites work: Q4228433
cites work: Time-and space-optimal contour computation for a set of rectangles
cites work: The contour problem for rectilinear polygons
description: scientific article; zbMATH DE number 845918