Convex hull of planarh-polyhedra

DOI10.1080/00207160310001650034zbMath1074.65024OpenAlexW2008498655MaRDI QIDQ4831398

Andy King, Axel Simon

Publication date: 29 December 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160310001650034

zbMATH Keywords

algorithmconvex hullpolygonal regions

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

The two variable per inequality abstract domain

Cites Work

• Unnamed Item
• Some characterizations of convex polyhedra
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
• An efficient algorithm for determining the convex hull of a finite planar set
• Algorithm for discovering the set of all the solutions of a linear programming problem