Intersection of polytope and hyperplane
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Determining the intersection of polytope and hyperplane in arbitrary dimension is of central interest in computational geometry. In some paper(this one in particular: https://pdfs.semanticscholar.org/f4a6/4713dbf19883878e1357a6dc2bdfc2a04f30.pdf) author mentioned the "Naive Algorithm" of finding all the intersection between edges and hyperplane.
However, I couldn't find a proof that the intersection of polytope and hyperplane is determined by the intersection of the hyperplane and polytope's edges; is this unproven? If it is can someone post a source?
discrete-mathematics computational-geometry open-problem
add a comment |Â
up vote
0
down vote
favorite
Determining the intersection of polytope and hyperplane in arbitrary dimension is of central interest in computational geometry. In some paper(this one in particular: https://pdfs.semanticscholar.org/f4a6/4713dbf19883878e1357a6dc2bdfc2a04f30.pdf) author mentioned the "Naive Algorithm" of finding all the intersection between edges and hyperplane.
However, I couldn't find a proof that the intersection of polytope and hyperplane is determined by the intersection of the hyperplane and polytope's edges; is this unproven? If it is can someone post a source?
discrete-mathematics computational-geometry open-problem
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Determining the intersection of polytope and hyperplane in arbitrary dimension is of central interest in computational geometry. In some paper(this one in particular: https://pdfs.semanticscholar.org/f4a6/4713dbf19883878e1357a6dc2bdfc2a04f30.pdf) author mentioned the "Naive Algorithm" of finding all the intersection between edges and hyperplane.
However, I couldn't find a proof that the intersection of polytope and hyperplane is determined by the intersection of the hyperplane and polytope's edges; is this unproven? If it is can someone post a source?
discrete-mathematics computational-geometry open-problem
Determining the intersection of polytope and hyperplane in arbitrary dimension is of central interest in computational geometry. In some paper(this one in particular: https://pdfs.semanticscholar.org/f4a6/4713dbf19883878e1357a6dc2bdfc2a04f30.pdf) author mentioned the "Naive Algorithm" of finding all the intersection between edges and hyperplane.
However, I couldn't find a proof that the intersection of polytope and hyperplane is determined by the intersection of the hyperplane and polytope's edges; is this unproven? If it is can someone post a source?
discrete-mathematics computational-geometry open-problem
edited Jul 31 at 3:23
asked Jul 30 at 22:22
404 n found
13
13
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
The polygon lies in a plane. The intersection of a hyperplane and a plane is either the entire plane or a line in the plane. Thus, if a hyperplane intersects the polygon in some point, it intersect the polygon's plane in a line through that point. This line necessarily crosses the edges of the polygon. Thus you can find the polygon's intersection with a hyperplane by finding the intersections of its edges with the hyperplane.
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
The polygon lies in a plane. The intersection of a hyperplane and a plane is either the entire plane or a line in the plane. Thus, if a hyperplane intersects the polygon in some point, it intersect the polygon's plane in a line through that point. This line necessarily crosses the edges of the polygon. Thus you can find the polygon's intersection with a hyperplane by finding the intersections of its edges with the hyperplane.
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
add a comment |Â
up vote
0
down vote
The polygon lies in a plane. The intersection of a hyperplane and a plane is either the entire plane or a line in the plane. Thus, if a hyperplane intersects the polygon in some point, it intersect the polygon's plane in a line through that point. This line necessarily crosses the edges of the polygon. Thus you can find the polygon's intersection with a hyperplane by finding the intersections of its edges with the hyperplane.
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
add a comment |Â
up vote
0
down vote
up vote
0
down vote
The polygon lies in a plane. The intersection of a hyperplane and a plane is either the entire plane or a line in the plane. Thus, if a hyperplane intersects the polygon in some point, it intersect the polygon's plane in a line through that point. This line necessarily crosses the edges of the polygon. Thus you can find the polygon's intersection with a hyperplane by finding the intersections of its edges with the hyperplane.
The polygon lies in a plane. The intersection of a hyperplane and a plane is either the entire plane or a line in the plane. Thus, if a hyperplane intersects the polygon in some point, it intersect the polygon's plane in a line through that point. This line necessarily crosses the edges of the polygon. Thus you can find the polygon's intersection with a hyperplane by finding the intersections of its edges with the hyperplane.
answered Jul 31 at 3:20
joriki
164k10179328
164k10179328
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
add a comment |Â
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
sorry, by polygon I mean polytope
– 404 n found
Jul 31 at 3:22
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867465%2fintersection-of-polytope-and-hyperplane%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password