David Pichardie, Yves Bertot  Home/Search
Context Related
| sop.inria.fr/lemme/Yves.B...hulls.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sop.inria.fr/lemme/Yve...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 degenerated cases that are often overlooked by conventional algorithm presentations. Algorithms to compute the convex hull ... (Update)
Cited by: More
Using Three-Valued Logic to Specify and Verify - Algorithms Of Computational (Correct)
Dependable Polygon-Processing Algorithms for Safety-Critical .. - Brandt, Schneider (2005) (Correct)
Visualizing Geometrical Statements with GeoView - Bertot, Guilhot, Pottier (2003) (Correct)
Active bibliography (related documents): More All
0.5: Automatically Proving Up-to Bisimulation - Hirschkoff (1998) (Correct)
0.3: Consistency of Topological Relations in the Presence of.. - Bennett, Cohn (Correct)
0.3: On Halving Line Arrangements - Beygelzimer, Radziszowski (Correct)
Similar documents based on text: More All
0.5: Extracting a Data Flow Analyser in Constructive Logic - Cachera, Jensen, Pichardie.. (2004) (Correct)
0.4: Type-Theoretic Functional Semantics - Bertot, Capretta, Barman (Correct)
0.4: QArith: Coq Formalisation of Lazy Rational Arithmetic - Niqui, Bertot (2003) (Correct)
Related documents from co-citation: More All
2: Computer Graphics - Principles and Practice (context) - Foley, van Damm et al. - 1992
2: Introduction to metamathematics (context) - Kleene - 1991
2: Machine Proofs in Geometry (context) - Chou, Gao et al. - 1994
BibTeX entry: (Update)
D. Pichardie and Y. Bertot. Formalizing Convex Hulls Algorithms. In TPHOLs'01, pages 346--361. LNCS 2152, Springer Verlag, 2001. http://citeseer.ist.psu.edu/pichardie01formalizing.html More
@article{ pichardie01formalizing,
author = "David Pichardie and Yves Bertot",
title = "Formalizing Convex Hull Algorithms",
journal = "Lecture Notes in Computer Science",
volume = "2152",
pages = "346+",
year = "2001",
url = "citeseer.ist.psu.edu/pichardie01formalizing.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
7 Cambridge University Press (context) - Boissonnat, Yvinec - 1995
5 Removing degeneracies by perturbing the problem or the world - Alliez, Devillers et al. - 2000
3 Machine Proofs in Geometry (context) - Chou, Gao et al. - 1994
3 Number 606 in Lecture Notes in Computer Science (context) - Knuth, Hulls - 1991
2 Using reAEection to build eOEcient and certied decision proc.. (context) - Boutin - 1997
1 Jean-Christophe Filliatre Daniel de Rauglaudre (context) - Barras, Boutin et al. - 1999
1 available as a Coq contribution at http://coq (context) - Kahn, constructive et al. - 1995
1 A constructive theory of ordered aOEne geometry (context) - von Plato - 1998
1 Formal specication and theorem proving breakthroughs in geom.. (context) - ois, Jean-Fran et al. - 1998
Documents on the same site (http://www-sop.inria.fr/lemme/Yves.Bertot/research.html):
Changing Data Structures in Type Theory: a study of natural.. - Magaud, Bertot (2000) (Correct)
Type-Theoretic Functional Semantics - Bertot, Capretta, Barman (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC