On computing approximate convex hulls

DOI10.1016/0020-0190(83)90062-5MaRDI QIDQ584737zbMATH OpenOpenAlexFDO

Authors Eljas Soisalon-Soininen

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90062-5

zbMATH Keywords

approximation algorithmsconvex hull of a pointset in the plane

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites work

• A Lower Bound to Finding Convex Hulls
• An efficient algorithm for determining the convex hull of a finite planar set
• Approximation algorithms for convex hulls
• Convex hulls of finite sets of points in two and three dimensions
• Divide and conquer for linear expected time

Cited in

(1)

• A note on approximate convex hulls

This page was built for publication: On computing approximate convex hulls

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