2026-04-17T00:49:26Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/236882026-01-30T08:16:11Zcom_2072_1033col_2072_452950

00925njm 22002777a 4500 dc López Monterde, Daniel author Martínez Bayona, Jonàs author Vigo Anglada, Marc author Pla García, Núria author 2014 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.) Peer Reviewed Postprint (author’s final draft) Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica::Aplicacions informàtiques a la física i l‘enginyeria Computer graphics Boundary representation Union of boxes Orthogonal polyhedra Informàtica gràfica A practical and robust method to compute the boundary of three-dimensional axis-aligned boxes