中文
相关论文

相关论文: On the multiple illumination numbers of convex bod…

200 篇论文

The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…

度量几何 · 数学 2026-05-01 Ilya Ivanov , Cameron Strachan

The illumination conjecture asserts that any convex body in $n$-dimensional Euclidean space can be illuminated by at most $2^n$ external light sources or parallel beams of light. Despite recent progress on the illumination conjecture, it…

度量几何 · 数学 2026-02-05 Andrii Arman , Jaskaran Singh Kaire , Andriy Prymak

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

度量几何 · 数学 2025-03-31 Lenny Fukshansky

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

度量几何 · 数学 2015-06-26 Carsten Schütt

A variation on the classical polygon illumination problem was introduced in [Aichholzer et. al. EuroCG'09]. In this variant light sources are replaced by wireless devices called k-modems, which can penetrate a fixed number k, of "walls". A…

计算几何 · 计算机科学 2019-10-21 Frank Duque , Carlos Hidalgo-Toscano

A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a…

度量几何 · 数学 2013-02-13 Karoly Bezdek

The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…

度量几何 · 数学 2016-02-24 Márton Naszódi

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

度量几何 · 数学 2017-03-30 Marek Lassak

The convex hull of a ball with an exterior point is called a spike (or cap). A union of finitely many spikes of a ball is called a spiky ball. If a spiky ball is convex, then we call it a cap body. In this note we upper bound the…

度量几何 · 数学 2022-12-16 Károly Bezdek , Ilya Ivanov , Cameron Strachan

The multi-fold chromatic number of the plane $\chi_m$ is the smallest number of colors $k$, sufficient to color each point of the Euclidean plane in exactly $m$ colors, so that for any pair of points at a unit distance from each other, two…

组合数学 · 数学 2022-06-28 Jaan Parts

We introduce the vertex index, vein(K), of a given centrally symmetric convex body K, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the…

度量几何 · 数学 2011-10-20 Karoly Bezdek , Alexander E. Litvak

In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex…

度量几何 · 数学 2020-10-13 Károly Bezdek , Zsolt Lángi

We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number $k$ of walls. We call these objects $k$-modems…

Let $K$ be a compact convex set and $m$ be a positive integer. The covering functional of $K$ with respect to $m$ is the smallest $\lambda\in[0,1]$ such that $K$ can be covered by $m$ translates of $\lambda K$. Estimations of the covering…

度量几何 · 数学 2021-11-16 Senlin Wu , Keke Zhang , Chan He

K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture…

度量几何 · 数学 2025-04-15 A. Bondarenko , A. Prymak , D. Radchenko

We show that there exist convex bodies of constant width in $\mathbb{E}^n$ with illumination number at least $(\cos(\pi/14)+o(1))^{-n}$, answering a question by G. Kalai. Furthermore, we prove the existence of finite sets of diameter $1$ in…

度量几何 · 数学 2024-06-27 Andrii Arman , Andriy Bondarenko , Andriy Prymak

The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk…

度量几何 · 数学 2013-11-05 M. Hujter , Z. Lángi

We extend the notion of illumination bodies to Riemannian spaces of constant curvature and to projective Finsler geometries. We prove that the derivative of their volume defines a notion of surface area for convex bodies in these settings,…

度量几何 · 数学 2026-05-26 Rotem Assouline , Florian Besau , Elisabeth M. Werner

We present a probabilistic model of illuminating a convex body by independently distributed light sources. In addition to recovering C.A. Rogers' upper bounds for the illumination number, we improve previous estimates of J. Januszewski and…

度量几何 · 数学 2016-06-30 Galyna Livshyts , Konstantin Tikhomirov

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

计算几何 · 计算机科学 2026-01-26 Sunil Arya , David M. Mount
‹ 上一页 1 2 3 10 下一页 ›