Název:	Faster ASV decomposition for orthogonal polyhedra, using the extreme vertices model (EVM)
Autoři:	Aguilera, Antonio Ayala, Dolors
Citace zdrojového dokumentu:	Journal of WSCG. 2000, vol. 8, no. 1-3.
Datum vydání:	2000
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://hdl.handle.net/11025/15817 http://wscg.zcu.cz/wscg2000/wscg_2000_program.htm
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	objemové modelování;konstruktivní prostorová geometrie;booleovské operátory;ASV rozložení;funkce rozpoznávání formy
Klíčová slova v dalším jazyce:	solid modeling;constructive solid geometry;boolean operations;ASV decomposition;form feature recognition
Abstrakt v dalším jazyce:	The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature recognition, among others. The obtained CSG tree has convex primitives at its leaf nodes, while the contents of its internal nodes alternate between the setunion and set-difference operators. This paper first shows that the obtained CSG tree T can also be expressed as the regularized Exclusive-OR operation among all the convex primitives at the leaf nodes of T , regardless the structure and internal nodes of T . The importance of this result becomes apparent, for example, with those solid modeling schemes, for which the Exclusive-OR operation can be performed much faster than both the set union and set difference operators. This is the case for the Extreme Vertices Model (EVM) for orthogonal polyhedra. Therefore, this paper is then devoted for applying this result to orthogonal polyhedra, using the Extreme Vertices Model. It also includes a comparision of using this result vs. not-using it when finding the ASV decomposition of orthogonal polyhedra, as well as some practical uses for the ASV decomposition of orthogonal polyhedra.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 8, number 1-3 (2000)

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.