## Foundation of a Computable Solid Modelling (2002)

### Cached

### Download Links

- [www.doc.ic.ac.uk]
- [www.doc.ic.ac.uk]
- [www.doc.ic.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 33 - 13 self |

### BibTeX

@INPROCEEDINGS{Edalat02foundationof,

author = {Abbas Edalat and André Lieutier},

title = {Foundation of a Computable Solid Modelling},

booktitle = {Theoretical Computer Science},

year = {2002},

pages = {278--284}

}

### Years of Citing Articles

### OpenURL

### Abstract

Solid modelling and computational geometry are based on classical topology and geometry in which the basic predicates and operations, such as membership, subset inclusion, union and intersection, are not continuous and therefore not computable. But a sound computational framework for solids and geometry can only be built in a framework with computable predicates and operations. In practice, correctness of algorithms in computational geometry is usually proved using the unrealistic Real RAM machine model of computation, which allows comparison of real numbers, with the undesirable result that correct algorithms, when implemented, turn into unreliable programs. Here, we use a domaintheoretic approach to recursive analysis to develop the basis of an eective and realistic framework for solid modelling. This framework is equipped with a well-dened and realistic notion of computability which reects the observable properties of real solids. The basic predicates and operations o...