Parallel batched planar point location on the CCC (Q582096)
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 4130015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel batched planar point location on the CCC |
scientific article; zbMATH DE number 4130015 |
Statements
Parallel batched planar point location on the CCC (English)
0 references
1989
0 references
We consider the following problem, called ``batched planar point location'': Given a planar subdivision R induced by a plane graph \(G=(V,E)\), with \(| V| =N\), and a set S of M points in the plane, we wish to locate in parallel S in R, i.e., for each point \(p\in S\), we wish to find the region of R containing p. We assume throughout that \(M=\Theta (N)\).
0 references
point location
0 references
computational geometry
0 references
parallel computation
0 references
fixed interconnections
0 references
CREW PRAM
0 references
cube-connected-cycle (CCC) architecture
0 references
0.7903937101364136
0 references
0.7778407335281372
0 references
0.7775506973266602
0 references
0.7628070116043091
0 references
