Related papers: Lattice Surfaces and smallest triangles

We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…

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…

We study the vortex distribution of the wave functions minimizing the Gross Pitaevskii energy for a fast rotating condensate in the Lowest Landau Level (LLL): we prove that the minimizer cannot have a finite number of zeroes thus the…

The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…

In this paper we consider the Virtual Element discretization of a minimal surface problem, a quasi-linear elliptic partial differential equation modeling the problem of minimizing the area of a surface subject to a prescribed boundary…

Since J. L. Lagrange initiated in 1760 the study of minimal surfaces of Euclidean 3-space, minimal surfaces in real space forms have been studied extensively by many mathematicians during the last two and half centuries. In contrast, so far…

In Euclidean space, one can use the dot product to give a formula for the area of a triangle in terms of the coordinates of each vertex. Since this formula involves only addition, subtraction, and multiplication, it can be used as a…

Given a set S of n points in the plane and a fixed angle 0 < omega < pi, we show how to find in O(n log n) time all triangles of minimum area with one angle omega that enclose S. We prove that in general, the solution cannot be written…

In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

In this work, we study the tensor ring decomposition and its associated numerical algorithms. We establish a sharp transition of algorithmic difficulty of the optimization problem as the bond dimension increases: On one hand, we show the…

We begin by studying the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of the semi-axes. We write down an explicit formula as an integral over the unit sphere in n-dimensions and use this…

This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…

In [1], the author considered the problem of the optimal approximation of symmetric surfaces by biquadratic B\'ezier patches. Unfortunately, the results therein are incorrect, which is shown in this paper by considering the optimal…

In this work we provide an algorithm approximating the tangent bivector at a point of a smooth surface through inscribed triangles converging to the point, regardless their form or position with respect to the tangent plane. This result is…

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'. In…

We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an…

Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…

This is a survey article on the theory of lattice points in large planar domains and bodies of dimensions 3 and higher, with an emphasis on recent developments and new methods, including a lot of results established only during the last few…