English
Related papers

Related papers: Least Capacity Point of Triangles

200 papers

For compact subsets $E$ of the unit disk $ \mathbb{D}$ we study the capacity of the condenser ${\rm cap}( \mathbb{D},E)$ by means of set functionals defined in terms of hyperbolic geometry. In particular, we study experimentally the case of…

Complex Variables · Mathematics 2021-02-15 Mohamed M. S. Nasser , Matti Vuorinen

The inaccessibility of a point p in a bounded domain D \subset R^n is the minimum of the lengths of segments through p with boundary at \bd D. The points of maximum inaccessibility I_D are those where the inaccessibility achieves its…

Metric Geometry · Mathematics 2010-09-16 Maria Calvo , Vicente Munoz

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

Optimization and Control · Mathematics 2011-12-22 Ilaria Fragalà , Filippo Gazzola , Jimmy Lamboley

What is the shape of the 2D convex region P from which, when 2 mutually congruent convex pieces with maximum possible area are cut out, the highest fraction of the area of P is left over? When P is restricted to the set of all possible…

Combinatorics · Mathematics 2011-02-24 R. Nandakumar

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

Optimization and Control · Mathematics 2018-10-26 Sören Bartels , Gerd Wachsmuth

We are interested in the optimization of convex domains under a PDE constraint. Due to the difficulties of approximating convex domains in $\mathbb{R}^3$, the restriction to rotationally symmetric domains is used to reduce shape…

Optimization and Control · Mathematics 2022-06-13 Hedwig Keller , Sören Bartels , Gerd Wachsmuth

Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…

Differential Geometry · Mathematics 2007-05-23 Edward Goldstein

The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…

Optimization and Control · Mathematics 2012-04-10 Yogesh P. Awate

Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has…

Metric Geometry · Mathematics 2025-11-13 Gabor Ellmann

Let $Q$ be a finite set of points in the plane. For any set $P$ of points in the plane, $S_{Q}(P)$ denotes the number of similar copies of $Q$ contained in $P$. For a fixed $n$, Erd\H{o}s and Purdy asked to determine the maximum possible…

Combinatorics · Mathematics 2011-03-01 Bernardo M. Ábrego , Silvia Fernández-Merchant , David B. Roberts

We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…

Computational Geometry · Computer Science 2014-01-07 Boris Aronov , Mark V. Yagnatinsky

The cevian triangle corresponding to an interior point $M$ of a triangle is the triangle determined by the feet of the three cevians concurrent at $M$. It is known that the area of the cevian triangle for an interior point $M$ of a triangle…

Metric Geometry · Mathematics 2026-04-14 Yagub N. Aliyev

We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.

Metric Geometry · Mathematics 2026-05-14 Tommy Murphy , Kevin Tran

Lower bounds estimates are proved for the first eigenvalue for the Dirichlet Laplacian on arbitrary triangles using various symmetrization techniques. These results can viewed as a generalization of P\'olya's isoperimetric bounds. It is…

Spectral Theory · Mathematics 2008-07-17 Bartłomiej Siudeja

Let $C_{\theta}$ be a circular cone in Euclidean space $\mathbb{R}^{3}$,which apex is the origin and apex angle of the cone is $\theta\in \left(\pi/3, \pi\right)$. Let $M_\theta$ be the class of compact convex domains in Euclidean space…

Dynamical Systems · Mathematics 2024-10-29 Yi Yang

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…

Differential Geometry · Mathematics 2023-01-11 Tatsuya Miura

We prove that the first eigenvalue of the Dirichlet Laplacian for a triangle in the plane is bounded above by $\pi^2 L^2\over 9A^2$, where $L$ is the perimeter and $A$ is the area of this triangle. We show that the \mbox{constant 9} is…

Spectral Theory · Mathematics 2007-05-23 B. Siudeja

The study deals with the theory of interior capacities of condensers in a locally compact space, a condenser being treated here as a countable, locally finite collection of arbitrary sets with the sign +1 or -1 prescribed such that the…

Classical Analysis and ODEs · Mathematics 2009-06-25 Natalia Zorii
‹ Prev 1 2 3 10 Next ›