On the hyperbox - hyperplane intersection problem

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorLara, Carlos-
Autor(es): dc.creatorFlores, Juan J.-
Autor(es): dc.creatorCalderon, Felix-
Data de aceite: dc.date.accessioned2026-02-09T12:54:06Z-
Data de disponibilização: dc.date.available2026-02-09T12:54:06Z-
Data de envio: dc.date.issued2009-12-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Data de envio: dc.date.issued2017-08-01-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/15034-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1170539-
Descrição: dc.descriptionFinding 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 efficiently 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.-
Formato: dc.formatapplication/pdf-
Formato: dc.formatapplication/pdf-
Publicador: dc.publisherUniversidade Federal de Lavras (UFLA)-
Relação: dc.relationhttp://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/278/263-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
???dc.source???: dc.sourceINFOCOMP; Vol 8 No 4 (2009): December, 2009; 21-27-
???dc.source???: dc.source1982-3363-
???dc.source???: dc.source1807-4545-
Palavras-chave: dc.subjectHyperbox-
Palavras-chave: dc.subjectHyperrectangle-
Palavras-chave: dc.subjectHyperplane-
Palavras-chave: dc.subjectVector-
Palavras-chave: dc.subjectGraph searching-
Título: dc.titleOn the hyperbox - hyperplane intersection problem-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/article-
Tipo de arquivo: dc.typeinfo:eu-repo/semantics/publishedVersion-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.