[HTML][HTML] Packing, covering and tiling in two-dimensional spaces

C Zong - Expositiones Mathematicae, 2014 - Elsevier
Packing, covering and tiling is a fascinating subject in pure mathematics. It mainly deals with
arrangement patterns and efficiencies of geometric objects. This subject has a long and rich …

Possible global minimum lattice configurations for Thomson's problem of charges on a sphere

EL Altschuler, TJ Williams, ER Ratner, R Tipton… - Physical Review Letters, 1997 - APS
What configuration of N point charges on a conducting sphere minimizes the Coulombic
energy? JJ Thomson posed this question in 1904. For N≤ 112, numerical methods have …

How many plates?

DL Anderson - Geology, 2002 - pubs.geoscienceworld.org
Herein I address the current number of plates, the number there should be, and whether
there is a pattern in the plate mosaic. Related issues are the optimal sizes and shapes of …

A new fragile digital watermarking technique for a PDF digital Holy Quran

MA AlAhmad, I Alshaikhli… - … Conference on Advanced …, 2013 - ieeexplore.ieee.org
Digital media manipulation has become easily performed at personal level with the rapidly
growth of Technology. Presenting an issue of protecting digital media integrity …

Transition from spherical circle packing to covering: geometrical analogues of chemical isomerization

PW Fowler, T Tarnai - … of the Royal Society of London …, 1996 - royalsocietypublishing.org
How must n equal circles (spherical caps) of given angular radius r be arranged on the
surface of a sphere so that the area covered by the circles will be as large as possible? In …

Geodesic domes: Natural and man-made

T Tarnai - International Journal of Space Structures, 1996 - journals.sagepub.com
In this paper a brief account is devoted to structural forms related to geodesic domes
appearance in nature. It is shown how geodesic domes helped researchers outside …

[HTML][HTML] Discrete Voronoi games and ϵ-nets, in two and three dimensions

A Banik, JL De Carufel, A Maheshwari, M Smid - Computational Geometry, 2016 - Elsevier
The one-round discrete Voronoi game, with respect to an n-point user set U, consists of two
players Player 1 (P 1) and Player 2 (P 2). At first, P 1 chooses a set of facilities F 1 following …

Over-the-Air Federated Learning in Satellite systems

EA Carlos, R Pinard, M Hassani - arXiv preprint arXiv:2306.02996, 2023 - arxiv.org
Federated learning in satellites offers several advantages. Firstly, it ensures data privacy
and security, as sensitive data remains on the satellites and is not transmitted to a central …

The roundest polyhedra with symmetry constraints

A Lengyel, Z Gáspár, T Tarnai - Symmetry, 2017 - mdpi.com
Amongst the convex polyhedra with n faces circumscribed about the unit sphere, which has
the minimum surface area? This is the isoperimetric problem in discrete geometry which is …

Codes (spherical) and designs (experimental)

RH Hardin, NJA Sloane - Proceedings of Symposia in Applied …, 1995 - books.google.com
An overview of the authors' work (partly in collaboration with WD Smith) on the problems of
packing equal nonoverlapping spherical caps on a sphere in d dimensions, covering the …