English
Related papers

Related papers: Least Capacity Point of Triangles

200 papers

Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image…

Computer Vision and Pattern Recognition · Computer Science 2015-09-08 Loic A. Royer , David L. Richmond , Carsten Rother , Bjoern Andres , Dagmar Kainmueller

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an independent percolation model, the density decays to p_c with an inverse power, \lambda, of the distance to the origin. Assuming the existence of…

Probability · Mathematics 2007-05-25 Lincoln Chayes , Pierre Nolin

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

Computational Geometry · Computer Science 2021-08-31 Stephane Durocher , J. Mark Keil , Saeed Mehrabi , Debajyoti Mondal

In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…

Optimization and Control · Mathematics 2026-03-24 Beniamin Bogosel

Our main result is the following: {\it Let $E$ be a Banach space and $D$ be a weakly compact subset of $E$ with $0\notin D$. If $A$ is a bounded subset of $E$ such that every $x^*\in E^*$ with $x^*(D) >0$ attains its supremum on $A$, then…

Functional Analysis · Mathematics 2016-10-11 J. Orihuela

A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In this paper we consider the illumination range of the light…

Computational Geometry · Computer Science 2007-05-23 M. Abellanas , A. Bajuelos , G. Hernández , F. Hurtado , I. Matos , B. Palop

A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two disjoint triples. These were studied at length by Bra{\ss}…

Combinatorics · Mathematics 2020-12-22 Zoltán Füredi , Dhruv Mubayi , Jason O'Neill , Jacques Verstraëte

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

Let $\Omega$ be an open convex set in ${\mathbb R}^m$ with finite width, and let $v_{\Omega}$ be the torsion function for $\Omega$, i.e. the solution of $-\Delta v=1, v\in H_0^1(\Omega)$. An upper bound is obtained for the product of $\Vert…

Analysis of PDEs · Mathematics 2019-05-22 M. van den Berg , V. Ferone , C. Nitsch , C. Trombetti

Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…

Functional Analysis · Mathematics 2013-09-18 Aurora Fernandez Leon , Adriana Nicolae

In this paper, we use the properties of the self-polar triangle to not only show a novel method for a basic point-line enumerative problem of conics, but also present a series of closed-form solutions to the conics from all minimal…

Algebraic Geometry · Mathematics 2018-01-10 Yang Guo

We provide a complete characterisation of extreme points of the space of sofic representations. We also show that the restriction map $Sof(G,P^{\omega})$ to $Sof(H,P^{\omega})$, where $H\subset G$ is not always surjective. The first part of…

Dynamical Systems · Mathematics 2019-02-20 Liviu Paunescu

Given two pants decompositions of a compact orientable surface $S$, we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection number and polynomially on the Euler characteristic of $S$.…

Geometric Topology · Mathematics 2025-11-06 Marc Lackenby , Mehdi Yazdi

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

Analysis of PDEs · Mathematics 2020-04-21 Grey Ercole , Gilberto de Assis Pereira

Given a property $P$ of subspaces of a $T_1$ space $X$, we say that $X$ is {\em $P$-bounded} iff every subspace of $X$ with property $P$ has compact closure in $X$. Here we study $P$-bounded spaces for the properties $P \in \{\omega D,…

General Topology · Mathematics 2014-07-01 István Juhász , Lajos Soukup , Zoltán Szentmiklóssy

3D sensing and content capture have made significant progress in recent years and the MPEG standardization organization is launching a new project on immersive media with point cloud compression (PCC) as one key corner stone. In this work,…

Multimedia · Computer Science 2017-10-11 Yiting Shao , Zhaobin Zhang , Zhu Li , Kui Fan , Ge Li

Piecewise linear vector optimization problems in a locally convex Hausdorff topological vector spaces setting are considered in this paper. The efficient solution set of these problems are shown to be the unions of finitely many semi-closed…

Optimization and Control · Mathematics 2017-09-27 Nguyen Ngoc Luan

In this work, the problem of shape optimization, subject to PDE constraints, is reformulated as an $L^p$ best approximation problem under divergence constraints to the shape tensor introduced in Laurain and Sturm: ESAIM Math. Model. Numer.…

Numerical Analysis · Mathematics 2024-04-02 Gerhard Starke

Let $P$ be a point of the Veronese surface $\Vcal$ in \PG53. Then thereare four conics of $\Vcal$ through $P$. We show that the internal points of those conics form a 12-cap which is a point model for Witt's 5-$(12,6,1)$ design. In fact,…

Combinatorics · Mathematics 2024-02-13 Hans Havlicek
‹ Prev 1 8 9 10 Next ›