Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1411.1395

On Covering a Solid Sphere with Concentric Spheres in ${\mathbb Z}^3$

Sahadev Bera·Partha Bhowmick·Bhargab B. Bhattacharya
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that a digital sphere, constructed by the circular sweep of a digital semicircle (generatrix) around its diameter, consists of some holes (absentee-voxels), which appear on its spherical surface of revolution. This incompleteness calls for a proper characterization of the absentee-voxels whose restoration will yield a complete spherical surface without any holes. In this paper, we present a characterization of such absentee-voxels using certain techniques of digital geometry and show that their count varies quadratically with the radius of the semicircular generatrix. Next, we design an algorithm to fill these absentee-voxels so as to generate a spherical surface of revolution, which is more realistic from the viewpoint of visual perception. We further show that covering a solid sphere by a set of complete spheres also results in an asymptotically larger count of absentees, which is cubic in the radius of the sphere. The characterization and generation of complete solid spheres without any holes can also be accomplished in a similar fashion. We furnish test results to substantiate our theoretical findings.

Explore related subjects

cs.CGcs.DM

Keep this discovery

BibTeXRIS

Sahadev Bera, Partha Bhowmick, Bhargab B. Bhattacharya. 2014-10-23. On Covering a Solid Sphere with Concentric Spheres in ${\mathbb Z}^3$. https://arxiv.org/abs/1411.1395

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗