Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Algebraic specification of a 3D-modeler based on hypermaps
CVGIP: Graphical Models and Image Processing
Some Topological Properties of Surfaces in Z3
Journal of Mathematical Imaging and Vision
Formal Specification and Theorem Proving Breakthroughs in Geometric Modeling
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Formalizing the Trading Theorem for the Classification of Surfaces
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
Proceedings of the 2007 ACM symposium on Applied computing
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
Theoretical Computer Science
Journal of Automated Reasoning
Formal study of plane delaunay triangulation
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Hi-index | 5.23 |
This paper is the second half of a two-part series devoted to the formalization of a combinatorial model of geometric varieties, generalized maps. We study here how to express continuous notions like homeomorphisms in the combinatorial world, in order to constructively describe the well-known theorem of surface classification according to genus, number of boundaries and orientability coefficient. We then use the Coq specification elaborated in the previous paper to prove the first half of this theorem, called the trading theorem.