31
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Convex hull of planar h-polyhedra

Pages 259-271 | Received 21 Jul 2003, Published online: 12 May 2010
 

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 ⊆ P.

E-mail: [email protected]

Notes

E-mail: [email protected]

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.