A fast parallel algorithm for convex hull problem of multi-leveled images
From MaRDI portal
Publication:1857643
DOI10.1023/A:1015083706590zbMATH Open1008.68641OpenAlexW1586211521MaRDI QIDQ1857643FDOQ1857643
Authors: J. Elmesbahi, A. Rami, Omar Bouattane
Publication date: 19 February 2003
Published in: Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015083706590
Recommendations
- A 1 log N parallel algorithm for detecting convex hulls on image boards
- A fast approximation to a convex hull
- Efficient parallel convex hull algorithms
- Iterative algorithms for the planar convex hull problem on mesh-connected arrays
- Two parallel algorithms for the convex hull problem in a two dimensional space
Computing methodologies and applications (68U99) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)
Cited In (7)
- A fast approximation to a convex hull
- Constant-time convexity problems on reconfigurable meshes
- A 1 log N parallel algorithm for detecting convex hulls on image boards
- Computing convexity properties of images on a pyramid computer
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Topological numbering of features on a mesh
- Title not available (Why is that?)
This page was built for publication: A fast parallel algorithm for convex hull problem of multi-leveled images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857643)