Related papers: The Average-Case Area of Heilbronn-Type Triangles

Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…

We study constant mean curvature surfaces in the three-dimensional Heisenberg group. We prove that a constant mean curvature surface in a neighborhood of non-umbilic point is described by some solution of a sinh-Gordon equation subject to a…

This is an innovative treatise on triangles, resting upon 1) 3-body problem techniques including mass-weighted relative Jacobi coordinates. 2) Part I's detailed layer-by-layer topological and geometrical study of Kendall-type shape spaces -…

A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

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…

Given a triangle ABC, a new triangle A'B'C' can be formed as follows: Draw the perpendicular to the line AB at the pointA; then the perpendicular to the line BC at B, and lastly the perpendicular to the line CA at C.the two triangles ABC…

If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…

There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…

For a triangle in the hyperbolic plane, let $\alpha,\beta,\gamma$ denote the angles opposite the sides $a,b,c$, respectively. Also, let $h$ be the height of the altitude to side $c$. Under the assumption that $\alpha,\beta, \gamma$ can be…

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…

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.

The problem of maximizing the average cross section through a point within a shape is introduced. This idea is extended into arbitrary dimensions. However, the average cross sectional volume cannot be maximized unless the cross sections…

We consider a space of $L^2$ vector fields with bounded mean oscillation whose ``normal'' component to the boundary is well-controlled. In the case when the dimension $n \geq 3$, we establish its Helmholtz decomposition for arbitrary…

Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set $A \subset [0, 1]^n$. Specifically, they gave a randomized algorithm such that if $A$'s surface area is less than $S$ then the algorithm will…

We develop a min-max theory for the construction of capillary surfaces in 3-manifolds with smooth boundary. In particular, for a generic set of ambient metrics, we prove the existence of nontrivial, smooth, almost properly embedded surfaces…

This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

In this paper we consider the problem of determining the Hilbert function of schemes X of the proiective space P^n which are the generic union of s lines and one m-multiple point. We completely solve this problem for any s and m when n > 3.…

We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…