TPHOLs 2001: Theorem Proving in Higher Order Logics pp 346-361 | Cite as
Formalizing Convex Hull Algorithms
Conference paper
First Online:
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.
Keywords
Convex Hull Decision Procedure Computational Geometry Convex Polygon Degenerate Case
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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.MATHCrossRefMathSciNetGoogle Scholar
- 2.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.Google Scholar
- 3.Jean-Daniel Boissonnat and Mariette Yvinec. Algorithmic geometry. Cambridge University Press, 1995.Google Scholar
- 4.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.CrossRefGoogle Scholar
- 5.S.C. Chou, X.S. Gao, and J.Z. Zhang. Machine Proofs in Geometry. World Scientific, Singapore, 1994.MATHGoogle Scholar
- 6.Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT-Press, 1990.Google Scholar
- 7.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.
- 8.Donald Knuth. Axioms and Hulls. Number 606 in Lecture Notes in Computer Science. Springer-Verlag, 1991.Google Scholar
- 9.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.CrossRefGoogle Scholar
- 10.Robert Sedgewick. Algorithms. Addison-Wesley, 1988.Google Scholar
- 11.Jan von Plato. A constructive theory of ordered affine geometry. Indagationes Mathematicae, 9:549–562, 1998.MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2001