Constructive solid geometry for polyhedral objects
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Partitioning Polyhedral Objects into Nonintersecting Parts
IEEE Computer Graphics and Applications
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Solid modeling on a massively parallel processor
International Journal of Supercomputer Applications and High Performance Engineering
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Solid modeling underlies many technologies that are key to modern manufacturing. These range from CAD systems to robot simulators, from finite-element analysis to integrated circuit process modeling. The accuracy, and hence the utility, of these models is often constrained by the amount of computer time required to perform the desired operations. In this paper we present, in detail, an efficient algorithm for parallel intersections of solids using the Connection Machine, a massively parallel SIMD processor. We describe the data structure for representing the solid models and detail the intersection algorithm, giving special attention to implementation issues. We provide performance results, comparing the parallel algorithm to a serial intersection algorithm.