Convex hull of planarh-polyhedra
Axel Simon, Andy King · International Journal of Computer Mathematics · 2004
Suppose are planar (convex) H-polyhedra, that is, A i ∈ ℝ n i ×2 and . Let and n = n 1 + n 2. We present an O(n log n) algorithm for calculating an H-polyhedron with the smallest such that P 1 ∪ P 2 ⊆ P.