Computability
Algebraic and fixed point equations over inverse limits of algebras
Theoretical Computer Science
Mathematical theory of domains
Mathematical theory of domains
Handbook of logic in computer science (vol. 4)
A hierarchy of domains with totality, but without density
Computability, enumerability, unsolvability
A computational model for metric spaces
Theoretical Computer Science
Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
Effective domain representations of H (X), the space of compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable banach spaces via domain theory
Theoretical Computer Science - Special issue on computability and complexity in analysis
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computation by “while” programs on topological partial algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Domain representations of topological spaces
Theoretical Computer Science
Computable analysis: an introduction
Computable analysis: an introduction
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
Volume Graphics
Computer
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Streams, Stream Transformers and Domain Representations
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Type Theory via Exact Categories
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Developing theories of types and computability via realizability
Developing theories of types and computability via realizability
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Partial continuous functions and admissible domain representations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computability in computational geometry
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hi-index | 5.23 |
A partial spatial object is a partial map from space to data. Data types of partial spatial objects are modelled by topological algebras of partial maps and are the foundation for a high level approach to volume graphics called constructive volume geometry (CVG), where space and data are subspaces of n dimensional Euclidean space. We investigate the computability of partial spatial object data types, in general and in volume graphics, using the theory of effective domain representations for topological algebras. The basic mathematical problem considered is to classify which partial functions between topological spaces can be represented by total continuous functions between given domain representations of the spaces. We prove theorems about partial functions on regular Hausdorff spaces and their domain representations, and apply the results to partial spatial objects and CVG algebras.