Improvements to a recent 3d-border algorithm

摘要

A linear oct-tree can be mapped into its three-dimensional border-representation by the repeated elimination of the internal boundaries existing between any two nodes. This paper shows that such a mapping can be efficiently implemented by a recursive algorithm in a single pass through the input data. Among the advantages of the procedure presented here with respect to the algorithm previously introduced by the authors are the elimination of costly dynamic insertions and deletions, the reduction of memory requirements and the search of smaller arrays.