Parallel batched planar point location on the CCC
From MaRDI portal
Publication:582096
DOI10.1016/0020-0190(89)90137-3zbMath0689.68063OpenAlexW2071153521MaRDI QIDQ582096
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90137-3
parallel computationcomputational geometryCREW PRAMpoint locationcube-connected-cycle (CCC) architecturefixed interconnections
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Discrete mathematics in relation to computer science (68R99)
Related Items
Maximum weight independent set of circular-arc graph and its application ⋮ On the multisearching problem for hypercubes ⋮ A simplified technique for hidden-line elimination in terrains ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
Cites Work