Results 1  10
of
20
On the number of incidences between points and curves
 Combinatorics, Probability & Computing
, 1998
"... ..."
Notes on geometric graph theory
 Discrete and Computational Geometry: Papers from DIMACS special year, volume 6 of DIMACS series, 273–285, AMS
, 1991
"... ..."
TRACES OF FINITE SETS: EXTREMAL PROBLEMS AND GEOMETRIC APPLICATIONS
, 1992
"... Given a hypergraph H and a subset S of its vertices, the trace of H on S is defined as HS = {E ∩ S: E ∈ H}. The Vapnik–Chervonenkis dimension (VCdimension) of H is the size of the largest subset S for which HS has 2 S edges. Hypergraphs of small VCdimension play a central role in many areas o ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Given a hypergraph H and a subset S of its vertices, the trace of H on S is defined as HS = {E ∩ S: E ∈ H}. The Vapnik–Chervonenkis dimension (VCdimension) of H is the size of the largest subset S for which HS has 2 S edges. Hypergraphs of small VCdimension play a central role in many areas of statistics, discrete and computational geometry, and learning theory. We survey some of the most important results related to this concept with special emphasis on (a) hypergraph theoretic methods and (b) geometric applications.
Simple proofs of classical theorems in discrete geometry via the GuthKatz polynomial partitioning technique
 DISCRETE COMPUT. GEOM
"... Recently Guth and Katz [16] invented, as a step in their nearly complete solution of Erdős’s distinct distances problem, a new method for partitioning finite point sets in R d, based on the Stone–Tukey polynomial hamsandwich theorem. We apply this method to obtain new and simple proofs of two well ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Recently Guth and Katz [16] invented, as a step in their nearly complete solution of Erdős’s distinct distances problem, a new method for partitioning finite point sets in R d, based on the Stone–Tukey polynomial hamsandwich theorem. We apply this method to obtain new and simple proofs of two well known results: the Szemerédi–Trotter theorem on incidences of points and lines, and the existence of spanning trees with low crossing numbers. Since we consider these proofs particularly suitable for teaching, we aim at selfcontained, expository treatment. We also mention some generalizations and extensions, such as the Pach–Sharir bound on the number of incidences with algebraic curves of bounded degree.
Isosceles Triangles Determined By a Planar Point Set
"... It is proved that, for any " > 0 and n > n 0 ("), every set of n points in the plane has at most n 5e 1 + triples that induce isosceles triangles. (Here e denotes the base of the natural logarithm, so the exponent is roughly 2:136.) This easily implies the best currently known l ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
It is proved that, for any " > 0 and n > n 0 ("), every set of n points in the plane has at most n 5e 1 + triples that induce isosceles triangles. (Here e denotes the base of the natural logarithm, so the exponent is roughly 2:136.) This easily implies the best currently known lower bound, n 5e 1 , for the smallest number of distinct distances determined by n points in the plane, due to Solymosi{C. Toth and Tardos.
Some scalable parallel algorithms for geometric problems
 Journal of Parallel and Distributed Computing
, 1999
"... This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with 0(n p) local memory each (i.e., 0(n p) memory cells of 3(log n) bits apiece), where the processors are connected to an arbitrary ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with 0(n p) local memory each (i.e., 0(n p) memory cells of 3(log n) bits apiece), where the processors are connected to an arbitrary interconnection network. It introduces efficient scalable parallel algorithms for a number of geometric problems including the rectangle finding problem, the maximal equally spaced collinear points problem, and the point set pattern matching problem. All of the algorithms presented are scalable in that they are applicable and efficient over a very wide range of ratios of problem size to number of processors. In addition to the practicality imparted by scalability, these algorithms are easy to implement in that all required communications can be achieved by a small number of calls to standard global routing operations.
Repeated angles in three and four dimensions
 SIAM J. Discrete Math
"... Abstract. We show that the maximum number of occurrences of a given angle in a set of n points in � 3 is O(n 7/3), and that a right angle can actually occur Ω(n 7/3) times. We then show that the maximum number of occurrences of any angle different from π/2 in a set of n points in � 4 is O(n 5/2 β(n) ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We show that the maximum number of occurrences of a given angle in a set of n points in � 3 is O(n 7/3), and that a right angle can actually occur Ω(n 7/3) times. We then show that the maximum number of occurrences of any angle different from π/2 in a set of n points in � 4 is O(n 5/2 β(n)), where β(n) = 2 O(α(n)2) and α(n) is the inverse Ackermann function.
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set
, 2001
"... We show the following two results on a set of n points in the plane, thus answering questions posed by Erdős and Purdy [11]: 1. The maximum number of triangles of maximum area (or of maximum perimeter) in a set of n points in the plane is exactly n. 2. The maximum possible number of triangles of min ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We show the following two results on a set of n points in the plane, thus answering questions posed by Erdős and Purdy [11]: 1. The maximum number of triangles of maximum area (or of maximum perimeter) in a set of n points in the plane is exactly n. 2. The maximum possible number of triangles of minimum positive area in a set of n points in the plane is �(n²).