相关论文: Planar Soap Bubbles
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…
In this paper we use stable capillary surfaces (analogous to the $\mu$-bubble construction) to study manifolds with strictly mean convex boundary and nonnegative scalar curvature. We give an obstruction to filling 2-manifolds by such…
A Matlab-based computational procedure is proposed to fill a given volume with spheres whose radii are randomly picked from any specified probability distribution supported by \verb|Matlab|. The general program sequence and examples of…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…
Interfacial deformation under electric fields is a common phenomenon in many industrial processes. Particularly, we are interested in the dynamics of sessile soap bubbles in a parallel-plate electric field which exhibits a stable…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
We use theory and numerical computation to determine the shape of an axisymmetric fluid membrane with a resistance to bending and constant area. The membrane connects two rings in the classic geometry that produces a catenoidal shape in a…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…
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…
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…
This study investigates laminar boundary layer separation over a fully porous Gaussian bump using pore-resolved direct numerical simulations. The bump is formed by randomly packed spheres. Compared to a solid bump, the porous surface…
We characterize the unique minimizer of the three-dimensional double-bubble problem with respect to the $\ell_1$-norm for volume ratios between $1/2$ and $2$.
The Euler--Plateau problem, proposed by \cite{gm}, concerns a soap film spanning a flexible loop. The shapes of the film and the loop are determined by the interactions between the two components. In the present work, the Euler--Plateau…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…
Aqueous foams are subject to coarsening, whereby gas from the bubbles diffuses through the liquid phase. Gas is preferentially transported from small to large bubbles, resulting in a gradual decrease of the number of bubbles and an increase…
We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…
In this paper, by studying the position of umbilical normal vectors in the normal bundle, we prove that pseudo-umbilical totally real submanifolds with flat normal connection in non-flat complex space forms must be minimal.