Line-segment intersection reporting in parallel
type: Item
instance of: scholarly article
title: Line-segment intersection reporting in parallel
zbMATH Open document ID: 0753.68095
DOI: 10.1007/BF01758839
author: Christine Rüb
published in: Algorithmica
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 64813
zbMATH Keywords: CREW PRAM
zbMATH Keywords: segment tree
MaRDI profile type: Publication
cites work: Parallel computational geometry
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: Reporting and counting segment intersections
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Fractional cascading. I: A data structuring technique
cites work: Parallel Merge Sort
cites work: Searching, Merging, and Sorting in Parallel Computation
cites work: Parallel Prefix Computation
cites work: Q3219753
full work available at URL: https://doi.org/10.1007/bf01758839
OpenAlex ID: W2028060421
description: scientific article; zbMATH DE number 64813