Abstract
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerate cases that are often overlooked by conventional algorithm presentations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pierre Alliez, Olivier Devillers, and Jack Snoeyink. Removing degeneracies by perturbing the problem or the world. Reliable Computing, 6:61–79, 2000. Special Issue on Computational Geometry.
Bruno Barras, Samuel Boutin, Cristina Cornes, Judicael Courant, Yann Coscoy, David Delahaye, Jean-Christophe Filliatre Daniel de Rauglaudre, Eduardo Gimenez, Hugo Herbelin, Gerard Huet, Cesar Munoz, Chetan Murthy, Catherine Parent, Christine Paulin-Mohring, Amokrane Saibi, and Benjamin Werner. The Coq Proof Assistant User’s Guide. Version 6.3.1. INRIA, December 1999.
Jean-Daniel Boissonnat and Mariette Yvinec. Algorithmic geometry. Cambridge University Press, 1995.
Samuel Boutin. Using reflection to build efficient and certified decision procedures. In Theoretical Aspects of Computer Science, number 1281 in Lecture Notes in Computer Science. Springer-Verlag, 1997.
S.C. Chou, X.S. Gao, and J.Z. Zhang. Machine Proofs in Geometry. World Scientific, Singapore, 1994.
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT-Press, 1990.
Gilles Kahn. Elements of constructive geometry group theory and domain theory, 1995. Available as a Coq contribution at http://coq.inria.fr/contribs-eng.html.
Donald Knuth. Axioms and Hulls. Number 606 in Lecture Notes in Computer Science. Springer-Verlag, 1991.
François Puitg and Jean-François Dufourd. Formal specification and theorem proving breakthroughs in geometric modeling. In Theorem Proving in Higher-Order Logics, volume 1479 of Lecture Notes in Computer Science, pages 410–422. Springer-Verlag, 1998.
Robert Sedgewick. Algorithms. Addison-Wesley, 1988.
Jan von Plato. A constructive theory of ordered affine geometry. Indagationes Mathematicae, 9:549–562, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pichardie, D., Bertot, Y. (2001). Formalizing Convex Hull Algorithms. In: Boulton, R.J., Jackson, P.B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science, vol 2152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44755-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-44755-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42525-0
Online ISBN: 978-3-540-44755-9
eBook Packages: Springer Book Archive