Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Algebraic specification of a 3D-modeler based on hypermaps
CVGIP: Graphical Models and Image Processing
Formalizing mathematics in higher-order logic: a case study in geometric modelling
Theoretical Computer Science
Functional specification and prototyping with oriented combinatorial maps
Computational Geometry: Theory and Applications
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
The design and implementation of panar maps in CGAL
Journal of Experimental Algorithmics (JEA)
Digital Picture Processing
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
The 5 Colour Theorem in Isabelle/Isar
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
Computer Vision and Image Understanding
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Formalizing the trading theorem in Coq
Theoretical Computer Science
A Lattice Approach to Image Segmentation
Journal of Mathematical Imaging and Vision
Contains and inside relationships within combinatorial pyramids
Pattern Recognition
nD generalized map pyramids: Definition, representations and basic operations
Pattern Recognition
Proceedings of the 2007 ACM symposium on Applied computing
Mechanical theorem proving in computational geometry
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Reversible polygonalization of a 3d planar discrete curve: application on discrete surfaces
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
Theoretical Computer Science
Journal of Automated Reasoning
Mechanical theorem proving in Tarski's geometry
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Constructive mathematics and functional programming
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Formal study of plane delaunay triangulation
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Designing and proving correct a convex hull algorithm with hypermaps in Coq
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an optimal imperative program. The planar subdivisions are modeled by hypermaps. The formal specifications of hypermaps and segmentation are developed in the Calculus of Inductive Constructions. The proofs are assisted by the Coq system. The final program is written in C.