Formalizing convex hull algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2152, Issue , 2001, Pages 346-361

  Pichardie, David ^a   Bertot, Yves ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; THEOREM PROVING;

BASIC PRINCIPLES; CONVENTIONAL ALGORITHMS; CONVEX HULL ALGORITHM; CONVEX HULL COMPUTATIONS; DEGENERATE CASE; FORMAL DESCRIPTION; MATHEMATICAL PROOF;

COMPUTATIONAL GEOMETRY;

EID: 84949516572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44755-5_24     Document Type: Conference Paper

References (11)

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.
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.
3. Jean-Daniel Boissonnat and Mariette Yvinec. Algorithmic geometry. Cambridge University Press, 1995.
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.
5. S.C. Chou, X.S. Gao, and J.Z. Zhang. Machine Proofs in Geometry. World Scientific, Singapore, 1994.
6. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT-Press, 1990.
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.
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.
10. Robert Sedgewick. Algorithms. Addison-Wesley, 1988.
11. Jan von Plato. A constructive theory of ordered affine geometry. Indagationes Mathematicae, 9:549–562, 1998.