Parallel geometric algorithms on a mesh-connected computer

DOI10.1007/BF01840383MaRDI QIDQ1825643zbMATH OpenFDO

Authors Yanyan Li

Publication date 1990

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometryparallel algorithmsVoronoi diagrammesh-connected computermultipoint location

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)

Recommendations

• Parallel Voronoi diagram in \(L_ 1(L_{\infty})\) metric on a mesh- connected computer
• scientific article; zbMATH DE number 4170139
• Parallel computational geometry
• An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
• On the parallel-decomposability of geometric problems

Cites work

• A Self-Routing Benes Network and Parallel Permutation Algorithms
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
• An optimal routing algorithm for mesh-connected Parallel computers
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Graph Problems on a Mesh-Connected Processor Array
• Parallel computational geometry
• Sorting on a mesh-connected parallel computer
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoi diagrams from convex hulls

Cited in

(15)

• Recursion and parallel algorithms in geometric modeling problems
• A parallel algorithm for volume projections on SIMD mesh-connected computers
• Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms
• Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes
• scientific article; zbMATH DE number 4170139 (Why is no real title available?)
• Dynamic computational geometry on meshes and hypercubes
• Simulating parallel neighboring communications among square meshes and square toruses
• Triangulation on reconfigurable meshes: A natural decomposition approach
• An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
• An efficient VLSI architecture with applications to geometric problems
• Voronoi-like partition of lattice in cellular automata
• scientific article; zbMATH DE number 4066315 (Why is no real title available?)
• An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
• On the parallel-decomposability of geometric problems
• AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗

This page was built for publication: Parallel geometric algorithms on a mesh-connected computer

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