Distributed algorithm for the planar convex hull problem
From MaRDI portal
DOI10.1016/0010-4485(90)90002-TzbMATH Open0687.68020MaRDI QIDQ1263282FDOQ1263282
Authors: K. Appert
Publication date: 1990
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Recommendations
- Two parallel algorithms for the convex hull problem in a two dimensional space
- Efficient parallel convex hull algorithms
- Iterative algorithms for the planar convex hull problem on mesh-connected arrays
- Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
- A 2-D parallel convex hull algorithm with optimal communication phases
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Software, source code, etc. for problems pertaining to computer science (68-04)
Cited In (5)
- Neuro-convex-hull computation from a set of circles
- Some problems in distributed computational geometry
- Two parallel algorithms for the convex hull problem in a two dimensional space
- Convex hull of a planar set of straight and circular line segments
- Distributed algorithm for extrema-finding in circular configuration of processors
This page was built for publication: Distributed algorithm for the planar convex hull problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263282)