Formalizing Convex Hulls Algorithms
Formalisation d'algorithmes d'enveloppes convexes
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.
Origin : Files produced by the author(s)
Loading...