Parallel batched planar point location on the CCC
From MaRDI portal
Publication:582096
DOI10.1016/0020-0190(89)90137-3zbMath0689.68063MaRDI 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 computation; computational geometry; CREW PRAM; point location; cube-connected-cycle (CCC) architecture; fixed interconnections
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
68R99: Discrete mathematics in relation to computer science
Related Items
AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS, Maximum weight independent set of circular-arc graph and its application, Output-sensitive generation of the perspective view of isothetic parallelepipeds, On the multisearching problem for hypercubes
Cites Work