This work presents the Binary Space Partition algorithm for the visualization of polyedric scenes (BSP algorithm, Fuchs 1980). It also includes the criteria for the election of the root face. The complexity of the involved algorithms is studied. A new algorithm for choosing the root face of the subtrees is presented and discussed. The performance of the algorithm is presented through seven examples.
CitationBrunet, P.; Pascual, J.; Vila, R. "L'algorisme de visualització per partició binaria de l'espai". 1989.