Mesh computer algorithms for computational geometry
From MaRDI portal
Publication:5375460
DOI10.1109/12.21120zbMath1395.68311OpenAlexW2108883356MaRDI 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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (8)
Towards optimal locality in mesh-indexings ⋮ 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 ⋮ Finite nondense point set analysis ⋮ Towards optimal locality in mesh-indexings
This page was built for publication: Mesh computer algorithms for computational geometry
