Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing
As a step toward the solution of the placement problem in engineering design, a procedure has been developed for detecting intersections of convex regions in 3-space by means of a pseudocharacteristic function. The mathematical techniques underlying the procedure are discussed, and a system of programs embodying these techniques is described. As a special case a solution is given for the hidden-line problem in graphic display. © 1968, ACM. All rights reserved.
Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
David Eppstein, Zvi Galil, et al.
Journal of the ACM
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR