Aykanat, Cevdetİşler, V.Özgüç, B.2016-02-082016-02-0819940010-4485http://hdl.handle.net/11693/26008Parallel ray tracing of complex scenes on multicomputers requires the distribution of both computation and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. The paper presents an efficient parallel subdivision algorithm that decomposes a given scene into rectangular regions adaptively and maps the resultant regions to the node processors of a multicomputer. The proposed algorithm uses efficient data structures to identify the splitting planes quickly. Furthermore the mapping of the regions and the objects to the node processors is performed while parallel spatial subdivision proceeds. The proposed algorithm is implemented on an Intel iPSC/2 hypercube multicomputer and promising results have been obtained. © 1994.Englishmulticomputersray tracingspatial subdivisionCalculationsComputer architectureComputersData storage equipmentData structuresData transferMappingParallel processing systemsSynchronizationAmdahl lawData coherenceGlobal memoryMulticomputersParallel ray tracingParallel subdivision algorithmsAlgorithmsArticle10.1016/0010-4485(94)90053-11879-2685