Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
From MaRDI portal
Recommendations
Cited in
(15)- Line-segment intersection reporting in parallel
- Edge intersection on the hypercube computer
- Planar stage graphs: Characterizations and applications
- Constructing arrangements optimally in parallel
- Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- SCALABLE ALGORITHMS FOR BICHROMATIC LINE SEGMENT INTERSECTION PROBLEMS ON COARSE GRAINED MULTICOMPUTERS
- scientific article; zbMATH DE number 1263244 (Why is no real title available?)
- scientific article; zbMATH DE number 1955838 (Why is no real title available?)
- On computing connected components of line segments
- scientific article; zbMATH DE number 2081104 (Why is no real title available?)
- Optimal shooting: Characterizations and applications
- Upper envelope onion peeling
- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
- Parallel algorithms for the segment dragging problem
This page was built for publication: Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978177)