Intersection of a polyhedron with a line
id:
intersection-of-a-polyhedron-with-a-line-243-18554715
title:
Intersection of a polyhedron with a line
text:
In computational geometry, the problem of computing the intersection of a polyhedron with a line has important applications in computer graphics, optimization, and even in some Monte Carlo methods. It can be viewed as a three-dimensional version of the line clipping problem. If the polyhedron is given as the intersection of a finite number of halfspaces, then one may partition the halfspaces into three subsets: the ones that include only one infinite end of the line, the ones that include the ot
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Intersection_of_a_polyhedron_with_a_line
date created:
date modified:
2021-07-06T20:50:02Z
main entity:
{"identifier":"Q6056725","url":"https://www.wikidata.org/entity/Q6056725"}
image:
fields total:
13
integrity:
13