Assertion: polygon | /r/CapableOf | find single point
Facets:
value: in the kernel
type: LOCATION
Source sentences:
text: Testing whether a polygon is star-shaped, and finding a single point in the kernel, may be solved in linear time by formulating the problem as a linear program and applying techniques for low-dimensional linear programming (see http://www.inf.ethz.ch/personal/emo/PublFiles/SubexLinProg_ALG16_96.pdf, page 16).