Convex Hull of Planar H-Polyhedra
| dc.creator | Simon, Axel | |
| dc.creator | King, Andy | |
| dc.date | 2004-05-24 | |
| dc.date.accessioned | 2026-07-07T03:21:20Z | |
| dc.date.available | 2026-07-07T03:21:20Z | |
| dc.description | Suppose $<A_i, \vec{c}_i>$ are planar (convex) H-polyhedra, that is, $A_i \in \mathbb{R}^{n_i \times 2}$ and $\vec{c}_i \in \mathbb{R}^{n_i}$. Let $P_i = \{\vec{x} \in \mathbb{R}^2 \mid A_i\vec{x} \leq \vec{c}_i \}$ and $n = n_1 + n_2$. We present an $O(n \log n)$ algorithm for calculating an H-polyhedron $<A, \vec{c}>$ with the smallest $P = \{\vec{x} \in \mathbb{R}^2 \mid A\vec{x} \leq \vec{c} \}$ such that $P_1 \cup P_2 \subseteq P$. | |
| dc.identifier | https://arxiv.org/abs/cs/0405089 | |
| dc.identifier | http://arxiv.org/abs/cs/0405089 | |
| dc.identifier | International Journal of Computer Mathematics, 81(4):259-271, 2004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32160 | |
| dc.subject | Computational Geometry | |
| dc.subject | I.3.5; I.3.6; F.3.1 | |
| dc.title | Convex Hull of Planar H-Polyhedra | |
| dc.type | text |