Abstract: Oriented to the scene composed of densely sampled meshes, this paper proposes a new scheme for binary space partition, which provides only references to the facets that occupy each partitioned space. Rather than sorting the facets of meshes according to their relative positions against the partitioning plane during the recursive space partitioning, as performed by all the current BSP algorithms, our scheme sorts the facets according to the relative location of the center point of each facet, and adopts these points for indexing. Since no facet needs to be split into small fragments, our partition scheme not only reduces the complexity of the scene BSP tree, but also yields significant time savings in BSP tree construction. Furthermore, as illustrated by our initial experimental results, the rendering time for ray-tracing a complex scene with our BSP tree is also reduced in most cases.