Pseudo-characteristic functions for convex polyhedra

DOI10.14321/REALANALEXCH.29.2.0821MaRDI QIDQ1769714zbMATH OpenOpenAlexFDO

Authors Stephen L. Judd, Johndale C. Solem, William A. Beyer

Publication date 4 April 2005

Published in Real Analysis Exchange (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14321/realanalexch.29.2.0821

zbMATH Keywords

characteristic functionscontainment problemconvex polytopepseudo-characteristic functionsregular simplex

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Review text

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

Recommendations

• Linear time approximation of 3D convex polytopes
• Does a point lie inside a polygon ?
• scientific article; zbMATH DE number 665688
• scientific article; zbMATH DE number 22873
• Construction of the convex hull of a point set as a system of linear inequalities

This page was built for publication: Pseudo-characteristic functions for convex polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769714)