Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
From MaRDI portal
Publication:751863
DOI10.1016/S0747-7171(08)80162-9zbMath0715.68091MaRDI QIDQ751863
Peter-Michael Schmidt, Walter Nef
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Unnamed Item
- Unnamed Item
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
- A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).
- Algorithms for Reporting and Counting Geometric Intersections
- Plane-sweep algorithms for intersecting geometric figures
- Platonic Divisions of Space
- Simple Partitions of Space
- Eulers Charakteristik und kombinatorische Geometrie.
This page was built for publication: Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution