Complexity and real computation
Complexity and real computation
Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
Domains and lambda-calculi
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
| Hi-index | 0.01 |
The model of computable partial solids has been recently introduced in order to address computational geometry and solid modeling issues within the Turing model of computation. This approach provides a model that reflects well the observable properties of real solids and the computation on realistic computers [5]. Since a central notion of discrete geometry, voxel sets, can be used to define computable partial solids, this approach throws a bridge between discrete geometry and solid modeling in Rn. This paper presents this model and the recursive analysis and domain theory prerequisites.