Journal of Symbolic Computation
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Information and Computation - Semantics of Data Types
Constructive mathematics: a foundation for computable analysis
Theoretical Computer Science - Special issue on computability and complexity in analysis
Ω-Arithmetization: A Discrete Multi-resolution Representation of Real Functions
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Arithmetization of a circular arc
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Exploring the foundations of discrete analytical geometry in Isabelle/HOL
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
Foundational aspects of multiscale digitization
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we recall the origins of discrete analytical geometry developed by J-P. Reveillès [1] in the nonstandard model of the continuum based on integers proposed by Harthong and Reeb [2,3]. We present some basis on constructive mathematics [4] and its link with programming [5,6]. We show that a suitable version of this new model of the continuum partly fits with the constructive axiomatic of R proposed by Bridges [7]. The aim of this paper is to take a first look at a possible formal and constructive approach to discrete geometry. This would open the way to better algorithmic definition of discrete differential concepts.