On weakly m-convex sets
Hajdzhaa Dakhil, Yurii Zelinskii, Bogdan Klishchuk
TL;DR
This paper investigates properties of weakly m-convex sets, explores shadow-related problems, and provides a lower bound on the number of balls needed to cast a shadow at a point on a sphere in 3D space.
Contribution
It introduces new properties of weakly m-convex sets, analyzes shadow problems, and establishes a lower estimate for the number of balls required to create a shadow in Euclidean space.
Findings
Properties of weakly m-convex sets were characterized.
Various shadow problems were analyzed.
A lower bound for the number of balls needed to cast a shadow was derived.
Abstract
There were obtained some properties of weakly m-convex sets. Various kinds of the problem of shadow were investigated. There was obtained the lower estimation for the number of balls that are necessary to create a shadow at the point of the sphere in three-dimensional Euclidean space
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Theoretical and Applied Studies in Material Sciences and Geometry