Computing the convex hull in a hammock

DOI10.1016/0020-0255(92)90045-AMaRDI QIDQ1177390zbMATH OpenFDO

Authors S. Singh

Publication date 26 June 1992

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(92)90045-A

zbMATH Keywords

convex hullline-segment intersections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Capturing crossings: convex hulls of segment and plane intersections
• Convex hull of planarh-polyhedra
• A linear algorithm for computing convex hulls for random lines
• The convex hull of a set of convex polygons

Cites work

• A fast convex hull algorithm
• An efficient algorithm for determining the convex hull of a finite planar set
• An optimal real-time algorithm for planar convex hulls
• Computing the convex hull of line intersections
• Convex hull of a finite set of points in two dimensions
• Convex hulls of finite sets of points in two and three dimensions
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• Reporting and counting segment intersections
• The Ultimate Planar Convex Hull Algorithm?

Cited in

(3)

• Bootstrapping convex hulls
• Recursive Calculation of Relative Convex Hulls
• Towards the computation of the convex hull of a configuration from its corresponding separating matrix

This page was built for publication: Computing the convex hull in a hammock

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