Foundation of a computable solid modelling.
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 domain-theoretic approach to recursive analysis to develop the basis of an effective and realistic framework for solid modelling. This framework is equipped with a well defined and realistic notion of computability which reflects the observable properties of real solids. The basic predicates and operations on solids are computable in this model which admits regular and non-regular sets and supports a design methodology for actual robust algorithms. Moreover, the model is able to capture the uncertainties of input data in actual CAD situations.
- A domain-theoretic approach to computability on the real line
- Complete local rings as domains
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computable Banach spaces via domain theory
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- Dynamical systems, measures, and fractals via domain theory
- Equilogical spaces
- Foundation of a computable solid modelling.
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (Why is no real title available?)
- scientific article; zbMATH DE number 1222088 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- scientific article; zbMATH DE number 1392302 (Why is no real title available?)
- scientific article; zbMATH DE number 3232606 (Why is no real title available?)
- Robustness of numerical methods in geometric computation when problem data is uncertain
- Theory of representations
- Towards a topology for computational geometry
- A computable approach to measure and integration theory
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Foundation of a computable solid modelling.
- Existence and computation of tours through imprecise points
- scientific article; zbMATH DE number 62659 (Why is no real title available?)
- WELL-FORMED SET REPRESENTATIONS OF SOLIDS
- Topological and Geometric Properties of Interval Solid Models
- A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Robustness and Randomness
- New Computational Paradigms
- Interval arithmetic yields efficient dynamic filters for computational geometry
- A Cartesian closed category for random variables
- Effectively open real functions
This page was built for publication: Foundation of a computable solid modelling.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607293)
