scientific article; zbMATH DE number 3592563
From MaRDI portal
Publication:4162137
Cited in
(10)- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
- Zur Eulerschen Charakteristik allgemeiner, insbesondere konvexer Polyeder
- Zur Einführung der Eulerschen Charakteristik und Begründung des Satzes von Euler-Schläfli
- A recursive sweep-plane algorithm, determining all cells of a finite division of R^ m.
- On the enumeration of polyhedra
- Exact, robust, and efficient regularized Booleans on general 3D meshes
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- A sweep-plane algorithm for generating random tuples in simple polytopes
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
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 Q4162137)