Results 1  10
of
12
Arrangements and Their Applications
 Handbook of Computational Geometry
, 1998
"... The arrangement of a finite collection of geometric objects is the decomposition of the space into connected cells induced by them. We survey combinatorial and algorithmic properties of arrangements of arcs in the plane and of surface patches in higher dimensions. We present many applications of arr ..."
Abstract

Cited by 78 (20 self)
 Add to MetaCart
The arrangement of a finite collection of geometric objects is the decomposition of the space into connected cells induced by them. We survey combinatorial and algorithmic properties of arrangements of arcs in the plane and of surface patches in higher dimensions. We present many applications of arrangements to problems in motion planning, visualization, range searching, molecular modeling, and geometric optimization. Some results involving planar arrangements of arcs have been presented in a companion chapter in this book, and are extended in this chapter to higher dimensions. Work by P.A. was supported by Army Research Office MURI grant DAAH049610013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR9122103 and CCR9311127, by a MaxPlanck Research Award, and by grants from the U.S.Israeli Binational Science Foundation, the Israel Science Fund administered by the Israeli Ac...
Extremal Problems for Geometric Hypergraphs
 Discrete Comput. Geom
, 1998
"... A geometric hypergraph H is a collection of idimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)tuples of a vertex set V in general position in dspace. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
A geometric hypergraph H is a collection of idimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)tuples of a vertex set V in general position in dspace. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and computational geometry. They include the kset problem, proximity questions, bounding the number of incidences between points and lines, designing various efficient graph drawing algorithms, etc. In this paper, we make an attempt to generalize some of these tools to higher dimensions. We will mainly consider extremal problems of the following type. What is the largest number of edges (isimplices) that a geometric hypergraph of n vertices can have without containing certain forbidden configurations? In particular, we discuss the special cases when the forbidden configurations are k intersecting edges...
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.
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 7 (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.
The SzemerédiTrotter theorem in the complex plane
, 305
"... This paper generalizes of the SzemerédiTrotter theorem to the complex plane. Szemerédi and Trotter proved that the number of pointline incidences of n points and e lines in the real Euclidean plane is O(n 2/3 e 2/3 + n + e). This bound is tight. Although several short proofs were found to this the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper generalizes of the SzemerédiTrotter theorem to the complex plane. Szemerédi and Trotter proved that the number of pointline incidences of n points and e lines in the real Euclidean plane is O(n 2/3 e 2/3 + n + e). This bound is tight. Although several short proofs were found to this theorem [14, 12], and many multidimensional generalizations were given, no tight bound has been known so far for incidences in higher dimensions. We extend the methods of Szemerédi and Trotter and prove that the number of pointline incidences of n points and e complex lines in the complex plane�2 is O(n
Graphs with large obstacle numbers
, 2010
"... Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if an only if the corresponding points can be connected by a segment which avoids all obstacles. The obstacle number of G is the minimum number of obstacles in an obstacle representation of G. It was shown in [3] that there exist graphs of n vertices with obstacle number at least Ω ( √ logn). We use extremal graph theoretic tools to show that (1) there exist graphs of n vertices with obstacle number at least Ω(n/log 2 n), and (2) the total number of graphs on n vertices with bounded obstacle number is at most 2 o(n2). Better results are proved if we are allowed to use only convex obstacles or polygonal obstacles with a small number of sides.
Lower bounds on the obstacle number of graphs
, 2011
"... Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacl ..."
Abstract
 Add to MetaCart
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The obstacle number of G is the minimum number of obstacles in an obstacle representation of G. It is shown that there are graphs on n vertices with obstacle number at least Ω(n/log n).
The number of unit distances is almost linear for most norms
"... We prove that there exists a norm in the plane under which no npoint set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric space of all norms (with the metric given by the Hausdorff dis ..."
Abstract
 Add to MetaCart
We prove that there exists a norm in the plane under which no npoint set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric space of all norms (with the metric given by the Hausdorff distance of the unit balls). 1
Radial Points in the Plane
, 2001
"... A radial point for a finite set P in the plane is a point q 62 P with the property that each line connecting q to a point of P passes through at least one other element of P . We prove a conjecture of Pinchasi, by showing that the number of radial points for a noncollinear nelement set P is O(n). ..."
Abstract
 Add to MetaCart
A radial point for a finite set P in the plane is a point q 62 P with the property that each line connecting q to a point of P passes through at least one other element of P . We prove a conjecture of Pinchasi, by showing that the number of radial points for a noncollinear nelement set P is O(n). We also present several extensions of this result, generalizing theorems of Beck, Szemer'edi and Trotter, and Elekes on the structure of incidences between points and lines. 1 Introduction Let P be a set of n points in the plane, not all lying on the same line. A point q = 2 P is called a radial point (for P ) if for every line ` passing through q we have j` " P j 6= 1. In other words, every line connecting q to some point p 2 P passes through at least one other element of P . For instance, let P be the vertex set of a regular 2kgon in the plane. Then, the intersection of the line at infinity with each line supporting an edge of P is a radial point for P . The center of the regular 2kgon ...