English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

An implementation of a Convex Hull Algorithm, Version 1.0

MPS-Authors
/persons/resource/persons45075

Müller,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45806

Ziegler,  Joachim
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-94-105.pdf
(Any fulltext), 290KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Müller, M., & Ziegler, J.(1994). An implementation of a Convex Hull Algorithm, Version 1.0 (MPI-I-94-105). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B4FF-E
Abstract
We give an implementation of an incremental construction algorithm for convex hulls in $\IR^d$ using {\em Literate Programming} and {\em LEDA} in C++. We treat convex hulls in arbitrary dimensions without any non-degeneracy assumption. The main goal of this paper is to demonstrate the benefits of the literate programming approach. We find that the time we spent for the documentation parts is well invested. It leads to a much better understanding of the program and to much better code. Besides being easier to understand and thus being much easier to modify, it is first at all much more likely to be correct. In particular, a literate program takes much less time to debug. The difference between traditional straight forward programming and literate programming is somewhat like the difference between having the idea to a proof of some theorem in mind versus actually writing it down accurately (and thereby often recognizing that the proof is not as easy as one thought).