Convex-Hull Algorithms: Implementation, Testing, and Experimentation
AbstractFrom a broad perspective, we study issues related to implementation, testing, and experimentation in the context of geometric algorithms. Our focus is on the effect of quality of implementation on experimental results. More concisely, we study algorithms that compute convex hulls for a multiset of points in the plane. We introduce several improvements to the implementations of the studied algorithms: plane-sweep, torch, quickhull, and throw-away. With a new set of space-efficient implementations, the experimental results—in the integer-arithmetic setting—are different from those of earlier studies. From this, we conclude that utmost care is needed when doing experiments and when trying to draw solid conclusions upon them. View Full-Text
- Supplementary File 1:
ZIP-Document (ZIP, 734 KB)
Externally hosted supplementary file 1
Description: Supplement: Relevant source code
Share & Cite This Article
Gamby, A.N.; Katajainen, J. Convex-Hull Algorithms: Implementation, Testing, and Experimentation. Algorithms 2018, 11, 195.
Gamby AN, Katajainen J. Convex-Hull Algorithms: Implementation, Testing, and Experimentation. Algorithms. 2018; 11(12):195.Chicago/Turabian Style
Gamby, Ask N.; Katajainen, Jyrki. 2018. "Convex-Hull Algorithms: Implementation, Testing, and Experimentation." Algorithms 11, no. 12: 195.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.