A practical and robust method to compute the boundary of three-dimensional axis-aligned boxes
Document typeConference report
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
The union of axis-aligned boxes results in a constrained structure that is advantageous for solving certain geometrical problems. A widely used scheme for solid modelling systems is the boundary representation (Brep). We present a method to obtain the B-rep of a union of axis-aligned boxes. Our method computes all boundary vertices, and additional information for each vertex that allows us to apply already existing methods to extract the B-rep. It is based on dividing the three-dimensional problem into two-dimensional boundary computations and combining their results. The method can deal with all geometrical degeneracies that may arise. Experimental results prove that our approach outperforms existing general methods, both in efficiency and robustness.)
CitationLopez, D. [et al.]. A practical and robust method to compute the boundary of three-dimensional axis-aligned boxes. A: International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications. "Proceedings of thr International Conference on Computer Graphics Theory and Applications (GRAPP 2014)". Lisboa: 2014, p. 34-42.