Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution

DOI10.1016/S0747-7171(08)80162-9zbMATH Open0715.68091MaRDI QIDQ751863FDOQ751863

Authors: Walter Nef, Peter-Michael Schmidt 

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 176571
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• Topologically sweeping an arrangement
• Sweep methods for parallel computational geometry
• Constructing Arrangements of Lines and Hyperplanes with Applications

zbMATH Keywords

linear mappingsweeping-plane

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Algorithms for Reporting and Counting Geometric Intersections
• Plane-sweep algorithms for intersecting geometric figures
• Eulers Charakteristik und kombinatorische Geometrie.
• 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\).
• Title not available (Why is that?)
• Platonic Divisions of Space
• Simple Partitions of Space

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751863)