Answers are grounded in this paper and cite their sources.
In this paper we discuss an algorithm to perform the conversion from the interior to the boundary of d-dimensional polyhedra, where both the d-polyhedron and its (d ; 1) boundary faces are represented as BSP trees. This approach allows also to compute the BSP tree of the set intersection between anyhyperplane in E d and the BSP representation of a d-polyhedron. If such section hyperplane is the affine support of a (d ; 1)-face, then a BSP tree of the face is generated. The algorithm may be iteratively applied to compute the k-skeletons of a d-polyhedron. ii 1
No takes yet. Share an insight, caveat, or question.
Baldazzi et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: