Elementary set operations with d-dimensional polyhedra
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Intersecting two polyhedra one of which is convexPublished by Springer Nature ,2006
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Methoden der grafischen und geometrischen DatenverarbeitungPublished by Springer Nature ,1986
- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean formComputing, 1985
- Space sweep solves intersection of convex polyhedraActa Informatica, 1984
- A sweep-plane algorithm for computing the volume of polyhedra represented in boolean formLinear Algebra and its Applications, 1983
- Ein rekursiver Gleitebenen-Algorithmus für die Bestimmung aller Zellen einer endlichen Teilung des RdComputing, 1982
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979