first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
Convex hull of planar h-polyhedra
Authors:
Axel Simon a;
Andy King a
| Affiliation: | a Computing Laboratory, University of Kent, Canterbury, UK |
DOI:
10.1080/00207160310001650034
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
81,
Issue
3
March
2004
, pages 259
- 271
International Journal of Computer Mathematics,
Volume
81,
Issue
3
March
2004
, pages 259
- 271
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 11
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
Suppose are planar (convex) H-polyhedra, that is, Ai ∈
 ni 2 and . Let and n = n1 + n2. We present an O(n log n) algorithm for calculating an H-polyhedron with the smallest such that P1 ∪ P2 ⊆ P.†E-mail: a.m.king@ukc.ac.uk |
| Keywords: Convex hull; Computational geometry |
| view references (11) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
