Simon, Axel and King, Andy (2004) Convex Hull of Planar H-Polyhedra. International Journal of Computer Mathematics, 81 (4). pp. 259-271. ISSN 0020-7160.
|
Download (246Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
Abstract
Suppose hAi;~cii are planar (convex) H-polyhedra, that is, Ai 2 Rni�2 and ~ci 2 Rni . Let Pi = f~x 2 R2 j Ai~x � ~cig and n = n1 +n2. We present an O(n log n) algorithm for calculating an H-polyhedron hA;~ci with the smallest P = f~x 2 R2 j A~x � ~cg such that P1 [ P2 � P.
| Item Type: | Article |
|---|---|
| Uncontrolled keywords: | convex hull, computational geometry |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 24 Nov 2008 18:02 |
| Last Modified: | 06 Sep 2011 01:26 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/14204 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
