Parallel batched planar point location on the CCC (Q582096): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A New Approach to Planar Point Location / rank | |||
Normal rank | |||
Latest revision as of 12:12, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel batched planar point location on the CCC |
scientific article |
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
