Foundation of a computable solid modelling.

DOI10.1016/S0304-3975(01)00091-3zbMath1042.68111MaRDI QIDQ1607293

André Lieutier, Abbas Edalat

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

RobustnessTuring computabilityModel of computationDomain theorySolid modelling

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Robustness and Randomness, Effectively open real functions, A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations, EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS, Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract], Interval arithmetic yields efficient dynamic filters 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.

Uses Software

• GCLC

Cites Work

• Robustness of numerical methods in geometric computation when problem data is uncertain
• Theory of representations
• A domain-theoretic approach to computability on the real line
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable Banach spaces via domain theory
• Foundation of a computable solid modelling.
• Equilogical spaces
• Towards a topology for computational geometry
• Dynamical systems, measures, and fractals via domain theory
• Complete local rings as domains
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item