On the Hyperbox – Hyperplane Intersection Problem

• Author(s): Lara, Carlos ; Flores, Juan J. ; Calderon, Felix
• Date: 2009
• Origin: Oasisbr
• Subject(s): hyperbox; hyperrectangle; hyperplane; vector; graph searching
• Document Type: Journal article
• Language: English

Description

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 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.