Pages that link to "Item:Q3978177"
From MaRDI portal
The following pages link to Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors (Q3978177):
Displaying 11 items.
- Parallel algorithms for the segment dragging problem (Q918740) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Edge intersection on the hypercube computer (Q1197977) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel (Q2373884) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- (Q4474217) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- Upper envelope onion peeling (Q5056118) (← links)
- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers (Q5060120) (← links)