VTechWorks staff will be away for the winter holidays starting Tuesday, December 24, 2024, through Wednesday, January 1, 2025, and will not be replying to requests during this time. Thank you for your patience, and happy holidays!
 

Some Performance Tests of Convex Hull Algorithms

Simple item page
dc.contributor.authorAllison, Donald C. S.en
dc.contributor.authorNoga, M. T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:03Zen
dc.date.available2013-06-19T14:37:03Zen
dc.date.issued1983en
dc.description.abstractThe two-dimensional convex hull algorithms of Graham, Jarvis, Eddy, and Akl and Toussaint are tested on four different planar point distributions. Some modifications are discussed for both the Graham and Jarvis algorithms. Timings taken of FORTRAN implementations indicate that the Eddy and Akl-Toussaint algorithms are superior on uniform distributions of poi nts in the plane. The Graham algorithm outperformed the others on those distributions where most of the points were on or near the boundary of the hull.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000879/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000879/01/CS83001-R.pdfen
dc.identifier.trnumberCS83001-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20261en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleSome Performance Tests of Convex Hull Algorithmsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS83001-R.pdf
Size:
914.22 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports