Related papers: Simple but not Simpler: A Surface-Sliding Method f…
This paper presents the first discrete-time distributed algorithm to track the tightest ellipsoids that outer approximates the global dynamic intersection of ellipsoids. Given an undirected network, we consider a setup where each node…
Our goal is to identify the type and number of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We assume uniform gravity and a frictionless, horizontal, planar support. We…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. The…
The explicit form of the interface equation of motion derived assuming a minimal surface is extended to general bicontinuous interfaces that appear in the diffusion limited stage of the phase separation process of binary mixtures. The…
A new method SREAG (spherical rectangular equal-area grid) is proposed to divide a spherical surface into equal-area cells. The method is based on dividing a sphere into latitudinal rings of near-constant width with further splitting each…
In mathematics, the classical Plateau problem consists of finding the surface of least area that spans a given rigid boundary curve. A physical realization of the problem is obtained by dipping a stiff wire frame of some given shape in…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
The problem of minimization of the sum of two convex functions has various theoretical and real-world applications. One of the popular methods for solving this problem is the proximal gradient method (proximal forward-backward algorithm). A…
The minimum orbital intersection distance is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications.…
We propose a two-dimensional flow model of a viscous fluid between two close moving surfaces. We show, using a formal asymptotic expansion of the solution, that its asymptotic behavior, when the distance between the two surfaces tends to…
We propose a two-dimensional flow model of a viscous fluid between two close moving surfaces. We show that its asymptotic behavior, when the distance between the two surfaces tends to zero, is the same as that of the the Navier-Stokes…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
A finite element method for elliptic problems with discontinuous coefficients is presented. The discontinuity is assumed to take place along a closed smooth curve. The proposed method allows to deal with meshes that are not adapted to the…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
Neural implicit surfaces are a promising tool for geometry processing that represent a solid object as the zero level set of a neural network. Usually trained to approximate a signed distance function of the considered object, these methods…
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
Relative motion between soft wet solids arises in a number of applications in natural and artificial settings, and invariably couples elastic deformation and fluid flow. We explore this in a minimal setting by considering a fluid-immersed…
We propose techniques for approximating bilevel optimization problems with non-smooth lower level problems that can have a non-unique solution. To this end, we substitute the expression of a minimizer of the lower level minimization problem…