Convexity problems on meshes with multiple broadcasting

DOI10.1006/JPDC.1995.1078MaRDI QIDQ1898223zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 April 1996

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1909cea4d5d37d4da68cbcc76d4a7a389a08d880

zbMATH Keywords

CREW-PRAMmultiple broadcasting

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Constant-time convexity problems on reconfigurable meshes
• Parallel algorithms for some functions of two convex polygons
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
• OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
• scientific article; zbMATH DE number 4170139

Cited in

(5)

• A note on lower bounds for the maximum area and maximum perimeter k-gon problems
• Time-optimal proximity graph computations on enhanced meshes
• Time-optimal tree computations on sparse meshes
• Constant-time convexity problems on reconfigurable meshes
• Optimal BSR solutions to several convex polygon problems

This page was built for publication: Convexity problems on meshes with multiple broadcasting

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