A more efficient convex hull algorithm

DOI10.1016/0020-0190(78)90042-XzbMATH Open0365.68029MaRDI QIDQ1241283FDOQ1241283

Authors: J. Koplowitz, D. Jouppi 

Publication date: 1978

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set

Cited In (5)

• Another efficient algorithm for convex hulls in two dimensions
• Randomized quickhull
• A fast convex hull algorithm
• The two variable per inequality abstract domain
• Convex hull of a finite set of points in two dimensions

This page was built for publication: A more efficient convex hull algorithm

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