Formalizing Convex Hulls Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Formalizing Convex Hulls Algorithms

Formalisation d'algorithmes d'enveloppes convexes

David Pichardie
Yves Bertot


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.
Fichier principal
Vignette du fichier
hulls.pdf (207.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01702679 , version 1 (07-02-2018)



David Pichardie, Yves Bertot. Formalizing Convex Hulls Algorithms. TPHOLs 2001 - 14th International Conference Theorem Proving in Higher Order Logics, Sep 2001, Edinburgh, United Kingdom. pp.346-361, ⟨10.1007/3-540-44755-5_24⟩. ⟨hal-01702679⟩
186 View
244 Download



Gmail Facebook Twitter LinkedIn More