Chen, Yi-LingChen, Bing-YuLai, Shang-HongNishita, Tomoyuki2015-02-232015-02-2320101467-8659https://diglib.eg.org/handle/10.2312/CGF.v29i7pp2011-2019https://doi.org/10.1111/j.1467-8659.2010.01787.xhttps://diglib.eg.org/handle/10.2312/CGF.v29i7pp2011-2019Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exterior regions with respect to the input point set. The BOTs are constructed by performing a traditional octree subdivision technique while the corners of each cell are associated with a tag indicating the in/out relationship with respect to the input point set. Starting from the root cell, a growing stage is performed to efficiently assign tags to the connected empty sub-cells. The unresolved tags of the remaining cell corners are determined by examining their visibility via the hidden point removal operator. We show that the outliers accompanying the input point set can be effectively detected during the construction of the BOTs. After removing the outliers and resolving the in/out tags, the BOTs are ready to support any volume or surface representation techniques. To represent the surfaces, we also present a modified MPU implicits algorithm enabled to reconstruct surfaces from the input unoriented point clouds by taking advantage of the BOTs.10.1111/j.1467-8659.2010.01787.x2011-2019