Abstract: Projected tetrahedra needs to sort tetrahedral datasets by frame.Parallel performance has been limited by the sequence and the dependency of neighboring tetrahedral.Based on these questions,we propose a quick and accurate sorting algorithm of tetrahedral datasets,which is view-dependent and based on logical partition.The algorithm takes 4 sequential steps.Firstly,we divide the space containing tetrahedral datasets into a list of blocks along the viewing direction,with every block containing a subset of tetrahedra;then,we sort accurately by peeling tetrahedral subsets into unobstructed layers in parallel;thirdly,we partition tetrahedra on boundary logically and compute the optical contribution of each subset with segment integration;finally,optical contribution of each subset is accumulated along the viewing direction.The experiment results show that our algorithm enhances the parallelization of topological sorting,reduces the sorting time largely and improves rendering performance greatly.