scientific article; zbMATH DE number 4110185
[For the entire collection see Zbl 0651.00016.] The authors present new algorithms for the elementary algebraic and topological operations on polyhedra in \({\mathbb{R}}^ d\), namely complement, intersection, union, difference, closure and interior. Problems have been caused by the fact that the family of polyhedra is not closed with respect to certain elementary operations. This situation has been got under control by an adaption of the definition of polyhedra. For the implementation of the operations it has been introduced a new geometric intermediate level, a so-called information structure. This information structure can be represented in a straightforward way by making use of an abstract data type pyramid.
- Convex polyhedral chains: A representation for geometric data
- Set-combinations of the mixed-dimension cellular objects of the Djinn API.
- An algorithm for the numerical detection of simplex overlap
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- scientific article; zbMATH DE number 3870615 (Why is no real title available?)
- Representation conversions for Nef polyhedra
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- Theories of real addition with and without a predicate for integers
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- Decidability of Definability Issues in the Theory of Real Addition
- Topology change mechanisms in explicit interface tracking: an interdisciplinary survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833669)