English
Related papers

Related papers: On some covering problems in geometry

200 papers

We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+\epsilon) and…

Data Structures and Algorithms · Computer Science 2019-04-30 Liwei Zeng , Karen Smilowitz , Sunil Chopra

Theoretical background is provided towards the mathematical foundation 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…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

Algebraic Topology · Mathematics 2010-11-23 Djordje Baralic , Branislav Prvulovic , Gordana Stojanovic , Sinisa Vrecica , Rade Zivaljevic

We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…

Complex Variables · Mathematics 2024-02-28 Norbert A'Campo , Athanase Papadopoulos

Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap…

Computational Geometry · Computer Science 2025-01-28 Hyuk Jun Kweon , Honglin Zhu

We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…

Computational Geometry · Computer Science 2014-11-26 Dae-Sung Jang , Han-Lim Choi

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…

Combinatorics · Mathematics 2009-03-13 Reinhard Steffens , Thorsten Theobald

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

Metric Geometry · Mathematics 2025-12-04 Ferenc Fodor , Balázs Grünfelder

We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…

Statistics Theory · Mathematics 2026-05-08 Athanasios G. Georgiadis , Andrew P. Percival

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

Metric Geometry · Mathematics 2007-08-21 Ronen Eldan , Bo'az Klartag

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

Metric Geometry · Mathematics 2015-02-25 Imre Bárány , Ferenc Fodor , Viktor Vígh

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…

Statistics Theory · Mathematics 2020-01-29 Jing Lei

We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…

Classical Analysis and ODEs · Mathematics 2022-05-26 Jean-Christophe Pain

In this paper, we introduce a Robin boundary analogue of the Orlicz-Minkowski problem, which seeks to find a capillary convex body with a prescribed capillary Orlicz surface area measure in the upper Euclidean half-space. We obtain the…

Differential Geometry · Mathematics 2025-09-16 Xudong Wang , Baocheng Zhu

This work is concerned with an inverse elastic scattering problem of identifying the unknown rigid obstacle embedded in an open space filled with a homogeneous and isotropic elastic medium. A Newton-type iteration method relying on the…

Numerical Analysis · Mathematics 2023-10-13 Yan Chang , Yukun Guo , Hongyu Liu , Deyue Zhang

We provide an overview of technics that lead to an Euclidean upper bound on the volume of geodesic balls.

Differential Geometry · Mathematics 2020-03-10 Gilles Carron

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…

Number Theory · Mathematics 2026-02-12 Nathan McNew , Jai Setty

Surveillance and surveying are two important applications of empirical research. A major part of terrain modelling is supported by photographic surveys which are used for capturing expansive natural surfaces using a wide range of sensors --…

Image and Video Processing · Electrical Eng. & Systems 2023-05-16 Maniratnam Mandal , Venkatesh K. Subramanian

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Functional Analysis · Mathematics 2022-06-22 Daniel J. Fresen

A novel framework for density estimation under expectation constraints is proposed. The framework minimizes the Wasserstein distance between the estimated density and a prior, subject to the constraints that the expected value of a set of…

Machine Learning · Statistics 2026-02-24 Yinan Hu , Esteban G. Tabak
‹ Prev 1 8 9 10 Next ›