54,498 research outputs found
Triangle areas in line arrangements
A widely investigated subject in combinatorial geometry, originated from
Erd\H{o}s, is the following. Given a point set of cardinality in the
plane, how can we describe the distribution of the determined distances? This
has been generalized in many directions. In this paper we propose the following
variants. Consider planar arrangements of lines. Determine the maximum
number of triangles of unit area, maximum area or minimum area, determined by
these lines. Determine the minimum size of a subset of these lines so that
all triples determine distinct area triangles.
We prove that the order of magnitude for the maximum occurrence of unit areas
lies between and . This result is strongly connected
to both additive combinatorial results and Szemer\'edi--Trotter type incidence
theorems. Next we show a tight bound for the maximum number of minimum area
triangles. Finally we present lower and upper bounds for the maximum area and
distinct area problems by combining algebraic, geometric and combinatorial
techniques.Comment: Title is shortened. Some typos and small errors were correcte
The number of unit-area triangles in the plane: Theme and variations
We show that the number of unit-area triangles determined by a set of
points in the plane is , improving the earlier bound
of Apfelbaum and Sharir [Discrete Comput. Geom., 2010]. We also consider two
special cases of this problem: (i) We show, using a somewhat subtle
construction, that if consists of points on three lines, the number of
unit-area triangles that spans can be , for any triple of
lines (it is always in this case). (ii) We show that if is a {\em
convex grid} of the form , where , are {\em convex} sets of
real numbers each (i.e., the sequences of differences of consecutive
elements of and of are both strictly increasing), then determines
unit-area triangles
Lower Bound for Convex Hull Area and Universal Cover Problems
In this paper, we provide a lower bound for an area of the convex hull of
points and a rectangle in a plane. We then apply this estimate to establish a
lower bound for a universal cover problem. We showed that a convex universal
cover for a unit length curve has area at least 0.232239. In addition, we show
that a convex universal cover for a unit closed curve has area at least
0.0879873.Comment: 12 pages, 9 figure
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
We formulate and give partial answers to several combinatorial problems on
volumes of simplices determined by points in 3-space, and in general in
dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by
points in \RR^3 is at most , and there are point sets
for which this number is . We also present an time
algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby
extend an algorithm of Edelsbrunner, O'Rourke, and Seidel. In general, for
every k,d\in \NN, , the maximum number of -dimensional
simplices of minimum (nonzero) volume spanned by points in \RR^d is
. (ii) The number of unit-volume tetrahedra determined by
points in \RR^3 is , and there are point sets for which this
number is . (iii) For every d\in \NN, the minimum
number of distinct volumes of all full-dimensional simplices determined by
points in \RR^d, not all on a hyperplane, is .Comment: 19 pages, 3 figures, a preliminary version has appeard in proceedings
of the ACM-SIAM Symposium on Discrete Algorithms, 200
The Average-Case Area of Heilbronn-Type Triangles
From among triangles with vertices chosen from points in
the unit square, let be the one with the smallest area, and let be the
area of . Heilbronn's triangle problem asks for the maximum value assumed by
over all choices of points. We consider the average-case: If the
points are chosen independently and at random (with a uniform distribution),
then there exist positive constants and such that for all large enough values of , where is the expectation of
. Moreover, , with probability close to one. Our proof
uses the incompressibility method based on Kolmogorov complexity; it actually
determines the area of the smallest triangle for an arrangement in ``general
position.''Comment: 13 pages, LaTeX, 1 figure,Popular treatment in D. Mackenzie, On a
roll, {\em New Scientist}, November 6, 1999, 44--4
- …