Related papers: On the shadow problem and its generalizations to e…
In the present work, the problem about shadow, generalized on domains of space $\mathbb{R}^n$, $n\le 3$, is investigated. Here the shadow problem means to find the minimal number of balls satisfying some conditions an such that every line…
We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of…
Problems, related to the determination of the minimal number of balls that generate a shadow at a fixed point in the multi-dimensional Euclidean space $ \mathbb{R}^n $, are considered in present work. Here, the statement "a system of balls…
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…
We present a new proof of the sphere covering inequality in the spirit of comparison geometry, and as a byproduct we find another sphere covering inequality which can be viewed as the dual of the original one. We also prove sphere covering…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
The problem of shadow is solved. It is equivalent to condition for point is in generalized convex hull of a family of compact sets.
This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
We consider the problem of a sphere rolling of a curved surface and solve it by mapping it to the precession of a spin 1/2 in a magnetic field of variable magnitude and direction. The mapping can be of pedagogical use in discussing both…
3D reconstruction is a fundamental problem in computer vision, and the task is especially challenging when the object to reconstruct is partially or fully occluded. We introduce a method that uses the shadows cast by an unobserved object in…
The \emph{general position problem} in graphs asks for a largest set of vertices in which no three lie on a common shortest path. The \emph{mutual-visibility problem} seeks a largest set of vertices such that every pair is connected by a…
The goal of this work is to study the smoothings of singular coaxial intersections of ellipsoids (where coaxial includes concentric) with generic singularities, with special attention to the 3-dimensional case.
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
We present a general mechanistic model of mass diffusion for a composite sphere placed in a large ambient medium. The multi-layer problem is described by a system of diffusion equations coupled via interlayer boundary conditions such as…
The aim of this essay is to better understand the Grasshopper Problem on the surface of the unit sphere. The problem is motivated by analysing Bell inequalities, but can be formulated as a geometric puzzle as follows. Given a white sphere…
The problem of fitting concentric ellipses is a vital problem in image processing, pattern recognition, and astronomy. Several methods have been developed but all address very special cases. In this paper, this problem has been investigated…
The primary objective of this paper is to construct an analytical model for determining the total duration of eclipse events of satellites. The approach assumes that the trace formed in the orbital plane, cutting body shadow under the…
The paper is focused on the four-dimensional visualization of hypersurfaces represented by implicit equations without their parametrization. We describe a general method to find shadow boundaries in an arbitrary dimension and apply it in a…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…