scientific article; zbMATH DE number 1017008

zbMATH Open0881.52001MaRDI QIDQ4339095FDOQ4339095

Publication date: 4 June 1997

Title of this publication is not available (Why is that?)

Recommendations

scientific article; zbMATH DE number 1749054
scientific article; zbMATH DE number 3846365
Combinatorial geometry and its algorithmic applications. The Alcalá lectures

arrangements density graph theory convexity combinatorial geometry convex sets coverings packings polygonal approximations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Cited In (only showing first 100 items - show all)

\((m, n)\)-equidistant sets in \(\mathbb{R}^{k},\mathbb{S}^{k}\), and \(\mathbb P^k\)
Colouring proximity graphs in the plane
An efficient \(k\) nearest neighbors searching algorithm for a query line.
Covering the plane by a sequence of circular disks with a constraint
Oja centers and centers of gravity
On finding maximum-cardinality symmetric subsets
On the Frankl-Rödl theorem
A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
Maximum number of edges joining vertices on a cube
Unavoidable crossings in a thinnest plane covering with congruent convex disks
Speeding up the incremental construction of the union of geometric objects in practice.
Sublinear time width-bounded separators and their application to the protein side-chain packing problem
On the sum of distances along a circle
Combinatorics and Algebra of Geometric Subdivision Operations
Almost empty monochromatic quadrilaterals in planar point sets
The multiplicity of the two smallest distances among points
On the stabbing number of a random Delaunay triangulation
New upper bound for the chromatic number of a random subgraph of a distance graph
Lower bounds for the chromatic numbers of distance graphs with large girth
Combinatorial spaces
A Ramsey-type result for geometric \(\ell\)-hypergraphs
A note on distinct distances in rectangular lattices
On Grids in Point-Line Arrangements in the Plane
Crossing patterns of segments
On the combinatorics of projective mappings
Noncrossing Hamiltonian paths in geometric graphs
Extremal problems on triangle areas in two and three dimensions
Title not available (Why is that?)
Theory and application of width bounded geometric separators
Centerpoints and Tverberg's technique
Radial points in the plane
Note on geometric graphs
Piercing translates and homothets of a convex body
Remarks on superstrings, fractal gravity, Nagasawa's diffusion and Cantorian spacetime
On the longest spanning tree with neighborhoods
On triple intersections of three families of unit circles
Discrete geometry on colored point sets in the plane -- a survey
Approximating set multi-covers
On uniformly distributed dilates of finite integer sequences
Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
A new proof of Vázsonyi's conjecture
An optimal generalization of the colorful Carathéodory theorem
A note on a problem of Erdős on right angles
Plane bichromatic trees of low degree
Outerplanar thrackles
Tight lower bounds for the size of epsilon-nets
On grids in point-line arrangements in the plane
Title not available (Why is that?)
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Constrained versions of Sauer's Lemma
On arrangements of orthogonal circles
Title not available (Why is that?)
The chromatic number of space with forbidden regular simplex
New results on the coarseness of bicolored point sets
\(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
On the stability of some Erdős-Ko-Rado type results
Independence numbers and chromatic numbers of some distance graphs
Dynamic coresets
Combinatorial geometry and its algorithmic applications. The Alcalá lectures
Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies
Improved results on geometric hitting set problems
Areas of triangles and Beck's theorem in planes over finite fields
On the diameter of separated point sets with many nearly equal distances
On the number of regular vertices of the union of Jordan regions
New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
An optimal extension of the centerpoint theorem
Drawing outerplanar graphs using thirteen edge lengths
Unit distances and diameters in Euclidean spaces
Title not available (Why is that?)
A PTAS for a disc covering problem using width-bounded separators
Covering the plane with copies of a convex disk
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
Hitting sets when the VC-dimension is small
The geometry of Minkowski spaces -- a survey. I
Embedding a set of rational points in lower dimensions
Nearly equal distances and Szemerédi's regularity lemma
On large subgraphs with small chromatic numbers contained in distance graphs
Title not available (Why is that?)
Diameters of random distance graphs
Independence numbers of random subgraphs of a distance graph
Crossing-free segments and triangles in point configurations
Independence numbers of random subgraphs of distance graphs
Convexity and sumsets
Piercing quasi-rectangles-on a problem of Danzer and Rogers
On levels in arrangements of surfaces in three dimensions
The Szemerédi-Trotter theorem in the complex plane
Separator theorems and Turán-type results for planar intersection graphs
Pointed drawings of planar graphs
Packing and covering with centrally symmetric convex disks
The shortest distance among points in general position.
Hamiltonian paths in distance graphs
Monotone paths in line arrangements
Geometry and combinatorics of the cutting angle method
Opaque sets
Covering a rectangle with six and seven circles
On the number of edges in induced subgraphs of a special distance graph
A new estimate for the number of edges in induced subgraphs of a special distance graph
A non-linear lower bound for planar epsilon-nets
Packing, covering and tiling in two-dimensional spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339095)