Edge intersection on the hypercube computer (Q1197977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge intersection on the hypercube computer |
scientific article; zbMATH DE number 92060 |
Statements
Edge intersection on the hypercube computer (English)
0 references
16 January 1993
0 references
We describe a parallel algorithm for a hypercube computer for determining and reporting the intersections between line segments lying on the plane. This problem occurs in many geometric applications such as interference detection, visible surface determination, and set operations on polygons.
0 references
computational geometry
0 references
performance evaluation
0 references
intersections of plane line segments
0 references
parallel algorithm
0 references
hypercube computer
0 references
0.816055178642273
0 references
0.7935996651649475
0 references
0.7845888733863831
0 references
0.7768455147743225
0 references
