Designing and proving correct a convex hull algorithm with hypermaps in Coq
Authors:
- Christophe BrunCBChristophe Brun
- Jean-François DufourdJDJean-François Dufourd
- Nicolas MagaudNMNicolas Magaud
- 1 October 2012
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 45 (8) , 436-457
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Intuitionistic Proof of a Discrete Form of the Jordan Curve Theorem Formalized in Coq with Combinatorial HypermapsJournal of Automated Reasoning, 2009
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proofTheoretical Computer Science, 2008
- Classroom examples of robustness problems in geometric computationsComputational Geometry, 2008
- Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base2008
- Design and formal proof of a new optimal image segmentation program with hypermapsPattern Recognition, 2007
- Interactive Theorem Proving and Program Development2004
- A Proof of GMP Square RootJournal of Automated Reasoning, 2002
- Topological models for boundary representation: a comparison with n- generalized mapsComputer-Aided Design, 1991
- GWB: A Solid Modeler with Euler OperatorsIEEE Computer Graphics and Applications, 1982
- Combinatorial Oriented MapsCanadian Journal of Mathematics, 1979