Testing geometric convexity

DOI10.1007/978-3-540-30538-5_39MaRDI QIDQ5465878zbMATH OpenOpenAlexFDO

Authors Luis Rademacher, Santosh S. Vempala

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Testing convexity of figures under the uniform distribution
• Sample-based high-dimensional convexity testing
• Testing convexity of figures under the uniform distribution
• A geometric inequality and the complexity of computing volume
• Approximating the volume of convex bodies

Cited in

(20)

• Detecting geometric infeasibility
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Active-learning a convex body in low dimensions
• Approximating a planar convex set using a sparse grid
• Hypothesis Testing in Integral Geometry
• On approximate convexity
• Testing Euclidean Spanners
• Sample-based high-dimensional convexity testing
• Testing local properties of arrays
• Testing convexity of functions over finite domains
• Testing surface area with arbitrary accuracy
• Testing convexity of figures under the uniform distribution
• Testing surface area
• Norm-Induced Densities and Testing the Boundedness of a Convex Set
• scientific article; zbMATH DE number 7758320 (Why is no real title available?)
• Asymmetric convex intersection testing
• Two-sided convexity testing with certificates
• The power and limitations of uniform samples in testing properties of figures
• Property testing of LP-type problems
• Testing and learning convex sets in the ternary hypercube

This page was built for publication: Testing geometric convexity

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