Pages that link to "Item:Q1193518"
From MaRDI portal
The following pages link to Line-segment intersection reporting in parallel (Q1193518):
Displaying 11 items.
- Parallel algorithm for segment visibility reporting (Q688184) (← links)
- Parallel algorithms for the segment dragging problem (Q918740) (← links)
- Edge intersection on the hypercube computer (Q1197977) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Reporting red-blue intersections between two sets of connected ine segments (Q1566372) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Reporting and counting segment intersections (Q1821557) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Reporting Intersections of Polygons (Q3811702) (← links)
- Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors (Q3978177) (← links)
- Reporting red-blue intersections between two sets of connected line segments (Q4595496) (← links)