Mesh computer algorithms for computational geometry

DOI10.1109/12.21120zbMATH Open1395.68311OpenAlexW2108883356MaRDI QIDQ5375460FDOQ5375460

Authors: Russ Miller, Q. F. Stout 

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cited In (14)

• Finite nondense point set analysis
• The cut \&{} glue mesh generation algorithm
• Geometric problems on two-dimensional array processors
• On the parallel-decomposability of geometric problems
• Condensation algorithms for the regular mesh substructuring
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Towards optimal locality in mesh-indexings
• Intégration géométrie-maillage appliquée aux méthodes numériques
• MESH. A journey through discrete geometry. DVD-Video
• An algorithm oriented mesh database
• Towards optimal locality in mesh-indexings
• Title not available (Why is that?)
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors

This page was built for publication: Mesh computer algorithms for computational geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375460)