| A note on the implementation quality of a convex-hull algorithm | |
| Authors: | Ask Neve Gamby and Jyrki Katajainen |
| Publication: | CPH STL report 2017-3, Department of Computer Science, University of Copenhagen (2017), 25 pp. |
| Full text: |  PDF (624 kB) |
| Abstract: | This note is a critical commentary of the recent paper entitled "A total order heuristic-based convex hull algorithm for points in the plane" published in Computer-Aided Design 70 (2016), 153–160. In the abstract of that paper it is concluded that the presented algorithm is (1) "much faster" than its competitors (2) "without penalties in memory space". In our opinion, the paper is well written, but in this note we raise a few objections to these conclusions. |
| Related: |  HTML (Journal article) HTML (Source code)  ZIP (zip file) |
| BibLATEX: | @report{GK2017R,
author = {Ask Neve Gamby and Jyrki Katajainen},
title = {A note on the implementation quality of a convex-hull algorithm},
type = {CPH STL report},
number = {2017-3},
institution = {Department of Computer Science, University of Copenhagen},
year = {2017},
pagetotal = {25},
}
|