Convex-hull algorithms: Implementation, testing, and experimentation
Authors:Ask Neve Gamby and Jyrki Katajainen
Published in:Algorithms 11,12 (2018), Article 195
Full text:<pdf.gif>PDF (419 kB)  
DOI:10.3390/a11120195
Copyright:© The Authors
Abstract:From 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.
Related:<html.gif>HTML (Technical report)  <html.gif>HTML (Source code)  <html.gif>HTML (tar archive)  
BibLATEX:
@article{GK2018J,
  author = {Ask Neve Gamby and Jyrki Katajainen},
  title = {Convex-hull algorithms: {I}mplementation, testing, and
    experimentation},
  journaltitle = {Algorithms},
  volume = {11},
  number = {12},
  year = {2018},
  articleno = {195},
}
This page was generated by Jyrki Katajainen <jyrki@di.ku.dk> on 2018-11-29.