Pages that link to "Item:Q1825643"
From MaRDI portal
The following pages link to Parallel geometric algorithms on a mesh-connected computer (Q1825643):
Displaying 15 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Simulating parallel neighboring communications among square meshes and square toruses (Q547510) (← links)
- Parallel Voronoi diagram in \(L_ 1(L_{\infty})\) metric on a mesh- connected computer (Q808303) (← links)
- An efficient VLSI architecture with applications to geometric problems (Q1124264) (← links)
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer (Q1179250) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms (Q1381794) (← links)
- A parallel algorithm for volume projections on SIMD mesh-connected computers (Q1584963) (← links)
- Triangulation on reconfigurable meshes: A natural decomposition approach (Q1900321) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- (Q3495678) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ (Q4819959) (← links)
- Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes (Q5855822) (← links)