A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

Timothy M. Chan. A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. In Lars Arge, János Pach, editors, 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands. Volume 34 of LIPIcs, pages 733-738, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

Abstract

Abstract is missing.