Related papers: A generalized expression for filling congruent cir…
We study new types of geometric query problems defined as follows: given a geometric set $P$, preprocess it such that given a query point $q$, the location of the largest circle that does not contain any member of $P$, but contains $q$ can…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…
The smallest enclosing circle problem asks for the circle of smallest radius enclosing a given set of finite points on the plane. This problem was introduced in the 19th century by Sylvester [17]. After more than a century, the problem…
In this paper, we successfully set up a generalized sphere theorem for compact Riemannian manifolds with radial Ricci curvature bounded.
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…
In this article, using the computer, are enumerated all locally-rigid packings by $N$ congruent circles (spherical caps) on the unit sphere ${\Bbb S}^2 $ with $N < 12.$ This is equivalent to the enumeration of irreducible spherical contact…
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
Let $C_1, \dots, C_n$ denote the $1/n-$neighborhood of $n$ great circles on $\mathbb{S}^2$. We are interested in how much these areas have to overlap and prove the sharp bounds $$ \sum_{i, j = 1 \atop i \neq j}^{n}{|C_i \cap C_j|^s}…
We introduce and study a new class of generalized inverses in rings. An element $a$ in a ring $R$ has generalized Zhou inverse if there exists $b\in R$ such that $bab=b, b\in comm^2(a), a^n-ab\in \sqrt{J(R)}$ for some $n\in {\Bbb N}$. We…
Sphere fitting is a common problem in almost all science and engineering disciplines. Most of methods available are iterative in behavior. This involves fitting of the parameters in a least square sense or in a geometric sense. Here we…
A circle C holds a convex body K if C does not meet the interior of K and if there does not exist any euclidean displacement which moves C as far as desired from K, avoiding the interior of K. The purpose of this note is to explore how…
An effective radius of convergence is defined and computed for any truncated Taylor series. Applications to well known series are performed and is shown that a range of good coincidence for actual and approximative plot can always be found.…
In this note we extend a theorem from [13] about uniform circle random coverings
This paper unifies several generalizations of coherent rings in one notion. Namely, we introduce $n$-$\mathscr{X}$-coherent rings, where $\mathscr{X}$ is a class of modules and $n$ is a positive integer, as those rings for which the…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…