Pseudo-characteristic functions for convex polyhedra (Q1769714)

For a convex \(n\)-polytope \(P\) in \(\mathbb{R}^n\), the authors present an algorithm to construct polynomials of degree \(2r\) that determine approximately whether a point \(p\) lies in- or outside of \(P\). (Here \(r\) is a positive integer, where the order of the approximation can be made arbitrarily small by taking \(r\) sufficiently large.) They give concrete examples for dimensions 2, 3, and 4 (e.g., in the latter case investigating the equilateral simplex).