Title :
Solving general intersection problem, sorting and 3D containment problem
Author :
Semwal, Sudhanshu Kumar
Author_Institution :
Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA
Abstract :
The author presents three hardware solutions for solving the general intersection problem. These solutions can be implemented as an algorithm on parallel computers or special-purpose VLSI circuits can be designed. Next a solution is presented for sorting nonunique keys in O(log n) time. Finally, the author presents a novel solution for the 3-D containment problem using quad trees.<>
Keywords :
computational geometry; 3D containment problem; general intersection problem; hardware solutions; parallel computers; quad trees; sorting; special-purpose VLSI circuits; Application software; Circuits; Computational geometry; Computer graphics; Computer science; Hardware; Sorting; Springs; Very large scale integration; Wiring;
Conference_Titel :
Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-8186-1918-x
DOI :
10.1109/PCCC.1989.37425
