Space sweep solves intersection of convex polyhedra
- 1 December 1984
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 21 (5) , 501-519
- https://doi.org/10.1007/bf00271644
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Program Complexity of Searching a Table.Published by Defense Technical Information Center (DTIC) ,1983
- A sweep-plane algorithm for computing the volume of polyhedra represented in boolean formLinear Algebra and its Applications, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Ein rekursiver Gleitebenen-Algorithmus für die Bestimmung aller Zellen einer endlichen Teilung des RdComputing, 1982
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Geometric intersection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975
- Eulers Charakteristik und kombinatorische Geometrie.Journal für die reine und angewandte Mathematik (Crelles Journal), 1955