Mesh computer algorithms for computational geometry
From MaRDI portal
Publication:5375460
DOI10.1109/12.21120zbMath1395.68311MaRDI QIDQ5375460
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.21120
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
Finite nondense point set analysis, Geometric problems on two-dimensional array processors, On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors, Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers, Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers, On the parallel-decomposability of geometric problems, Towards optimal locality in mesh-indexings