RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Please use this identifier to cite or link to this item:
|Title: ||On the hyperbox: hyperplane intersection problem|
|???metadata.dc.creator???: ||Lara, Carlos|
Flores, Juan J.
Pesquisa em grafos
|Publisher: ||Editora da UFLA|
|Citation: ||LARA, C.; FLORES, J. J.; CALDERON, F. On the hyperbox: hyperplane intersection problem. INFOCOMP: Journal of Computer Science, Lavras, v. 8, n. 4, p. 21-27, Dec. 2009.|
|Abstract: ||Finding the intersection between a hyperbox and a hyperplane can be computationally expensive specially for high dimensional problems. Naive algorithms have an exponential complexity. A border node is a node (in the graph induced by the hyperbox) at or next to the intersection of the hyperbox and the hyperplane. The algorithm proposed in this paper implements a systematic way to efﬁciently generate border nodes; given a border node, a subset of its incident edges is explored to determine one or more intersections. This systematic exploration allows us to focus on the border region, discarding the two regions before and after the plane. Pruning those regions produces a computational cost linear on the number of vertices of the hyperpolygon that represents the intersection.|
|Other Identifiers: ||http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/278|
|Appears in Collections:||Infocomp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.