%0 Conference Proceedings %T Formalizing Convex Hulls Algorithms %T Formalisation d'algorithmes d'enveloppes convexes %+ Logiciel : ANalyse et DEveloppement (Lande) %+ Mathematical, Reasoning and Software (MARELLE) %A Pichardie, David %A Bertot, Yves %< avec comité de lecture %( LNCS %B TPHOLs 2001 - 14th International Conference Theorem Proving in Higher Order Logics %C Edinburgh, United Kingdom %I Springer %3 TPHOLs 2001: Theorem Proving in Higher Order Logics %V 2152 %P 346-361 %8 2001-09-03 %D 2001 %R 10.1007/3-540-44755-5_24 %Z Computer Science [cs]/Logic in Computer Science [cs.LO] %Z Computer Science [cs]/Computational Geometry [cs.CG]Conference papers %X 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. %G English %2 https://inria.hal.science/hal-01702679/document %2 https://inria.hal.science/hal-01702679/file/hulls.pdf %L hal-01702679 %U https://inria.hal.science/hal-01702679 %~ EC-PARIS %~ UNIV-RENNES1 %~ CNRS %~ INRIA %~ INSA-RENNES %~ INRIA-SOPHIA %~ INRIA-RENNES %~ IRISA %~ INRIASO %~ IRISA_SET %~ INRIA_TEST %~ TESTALAIN1 %~ INRIA2 %~ UR1-HAL %~ UR1-MATH-STIC %~ UR1-UFR-ISTIC %~ TEST-UNIV-RENNES %~ TEST-UR-CSS %~ UNIV-RENNES %~ INRIA-RENGRE %~ INSA-GROUPE %~ UR1-MATH-NUM