Abstract
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 R n. This paper presents this model and the recursive analysis and domain theory prerequisites.
Chapter PDF
References
Amadio, R.M., Curien, P.L., Domains and Lambda-Calculi, Cambridge Tracts in Theoretical Computer Science, 1998.
Blum, L., Cucker, F., Shub, M., Smale, S. Complexity and Real Computation, Springer-Verlag (1998)
Brattka, V., Weihrauch, K. Computatbility on subsets of Euclidean Space I: Closed and Compact Subsets To appear in TCS, 1998http://www.informatik.fernuni-hagen.de/cca/
Y.L. Ershov, Y. L., Computable functionals of finite types, journal of Algebra and Logic, volume 11, number 4,pages 367–437, 1972.
Edalat, A., Lieutier, A. Foundation for a Computable Solid Modeling, submitted to ACM Solid Modeling 1999, http://theory.doc.ic.ac.uk:80/ae/.
Abbas Edalat, private mail. Departement of Computing, Imperial College, London. http://theory.doc.ic.ac.uk:80/ae/.
Edalat, A. Domains for computation in mathemetics, physics and exact real arithmetic, Bulletin of Symbolic Logic, volume 3, number 4, page 401–452,1997.
Edalat, A., Potts, P.J., A new representation for exact real numbers, Electronic Notes in Theoretical Computer Science, volume 6, Proceedings of Mathematical Foundations of Programming Semantics 13, 1997, Available from URL:-http://www.elsevier.nl/locate/entcs/volume6.html, Elsevier Science B. V.
Lieutier, A. Représentation B.Rep et calculabilité, Journées modeleurs géométriques (1997) LMC, IMAG, Université Joseph Fourrier, BP 53X 38041Grenoble Cedex, France.
Lieutier, A. Toward a data type for Solid Modeling based on Domain Theory, Workshop on Computability and Complexity in Analysis, (Brno 98) Informatik Berichte 235, FernUniversitat Hagen, http://www.informatik.fernuni-hagen.de/cca/.
Pour-El, M.B., Richards, J.I., Computability in Analysis and Physics, Springer-Verlag (1989).
Preparata, F., Shamos, M, Computational Geometry: an introduction”, Springler-Verlag (1985).
Requicha, A., Tilove, R., Mathematical Foundations of Constructive Solid Geometry: General Topology of closed Regular Sets, Automata, Languages and Programming, University of Rochester, Rochester, New York, Production Automation Project, March 78.
Requicha, A.G., Representation for Rigid Solids: Theory, Methods, and Systems, Production Automation Project, The University of Rochester, New York, Computer Surveys, volume 12, number 4, 1980
Scott, D.S., Outline of a mathematical theory of computation, 4th Annual Princeton Conference on Information Sciences and Systems, pages 169–176, 1970.
Weihrauch K., A Simple Introduction to Computable Analysis Informatik Berichte 171-2/1995-FernUniversität, Gesamthochschule in Hagen, Germany, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lieutier, A. (1999). Computable Partial Solids and Voxels Sets. In: Bertrand, G., Couprie, M., Perroton, L. (eds) Discrete Geometry for Computer Imagery. DGCI 1999. Lecture Notes in Computer Science, vol 1568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49126-0_27
Download citation
DOI: https://doi.org/10.1007/3-540-49126-0_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65685-2
Online ISBN: 978-3-540-49126-2
eBook Packages: Springer Book Archive