SIGN IN
SIGN UP
The quickhull algorithm for convex hulls
Full Text:
PDF
Buy this Article
Authors:
C. Bradford Barber
Univ. of Minnesota, Minneapolis
David P. Dobkin
Princeton Univ., Princeton, NJ
Hannu Huhdanpaa
Configured Energy Systems, Inc., Plymouth, MN
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 22 Issue 4, Dec. 1996
Pages 469-483
ACM
New York, NY
, USA
table of contents
doi>
10.1145/235815.235821
1996 Article
Bibliometrics
· Downloads (6 Weeks): 58
· Downloads (12 Months): 609
· Downloads (cumulative): 9,086
· Citation Count: 246
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
convex hull
delaunay triangulation
geometric algorithms, languages, and systems
halfspace intersection
reliability
voronoi diagram
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder