Convex hull of planarh-polyhedra
Work
Year: 2004
Type: article
Abstract: 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 ⊆... more
Authors Axel Simon, Andy King
Institution University of Kent
Cites: 13
Cited by: 3
Related to: 10
FWCI: 0.426
Citation percentile (by year/subfield): 74.47
Field: Computer Science
Domain: Physical Sciences
Open Access status: green