scientific article; zbMATH DE number 1017008
From MaRDI portal
Publication:4339095
arrangementsdensitygraph theoryconvexitycombinatorial geometryconvex setscoveringspackingspolygonal approximations
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)
Recommendations
Cited in
(only showing first 100 items - show all)- \((m, n)\)-equidistant sets in \(\mathbb{R}^{k},\mathbb{S}^{k}\), and \(\mathbb P^k\)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Vulnerability of nearest neighbor graphs
- scientific article; zbMATH DE number 2229944 (Why is no real title available?)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Random polytopes and the wet part for arbitrary probability distributions
- Harmonic functions of polynomial growth on infinite penny graphs
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- The minimal volume of simplices containing a convex body
- Independence numbers and chromatic numbers of some distance graphs
- On the stability of some Erdős-Ko-Rado type results
- Edge integrity of nearest neighbor graphs and separator theorems
- 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
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- On the number of regular vertices of the union of Jordan regions
- A lower bound on opaque sets
- Dynamic coresets
- Plane graphs with straight edges whose bounded faces are acute triangles
- Approximating a convex body by a polytope using the epsilon-net theorem
- Oja centers and centers of gravity
- On the chromatic number of an infinitesimal plane layer
- On finding maximum-cardinality symmetric subsets
- Traveling the boundary of Minkowski sums.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the number of points in general position in the plane
- Areas of triangles and Beck's theorem in planes over finite fields
- Improved results on geometric hitting set problems
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- On the diameter of separated point sets with many nearly equal distances
- Approximation algorithms for polynomial-expansion and low-density graphs
- On the Frankl-Rödl theorem
- An optimal extension of the centerpoint theorem
- On threshold probability for the stability of independent sets in distance graphs
- Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies
- 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
- On the shortest separating cycle
- Unit distances and diameters in Euclidean spaces
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- Maximum number of edges joining vertices on a cube
- Drawing outerplanar graphs using thirteen edge lengths
- Unavoidable crossings in a thinnest plane covering with congruent convex disks
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- On the number of regular vertices of the union of Jordan regions
- Speeding up the incremental construction of the union of geometric objects in practice.
- scientific article; zbMATH DE number 3853879 (Why is no real title available?)
- A PTAS for a disc covering problem using width-bounded separators
- Covering the plane with copies of a convex disk
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- Monotone twist maps and Dowker-type theorems
- Hitting sets when the VC-dimension is small
- On the sum of distances along a circle
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- scientific article; zbMATH DE number 7559230 (Why is no real title available?)
- Embedding a set of rational points in lower dimensions
- On the independence number of minimum distance graphs
- The structure and number of global roundings of a graph
- System of unbiased representatives for a collection of bicolorings
- On \(n\)-dependence
- The density of Meissner polyhedra
- Nearly equal distances and Szemerédi's regularity lemma
- Combinatorics and Algebra of Geometric Subdivision Operations
- The geometry of Minkowski spaces -- a survey. I
- On large subgraphs with small chromatic numbers contained in distance graphs
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond
- Systems of distant representatives in Euclidean space
- scientific article; zbMATH DE number 431994 (Why is no real title available?)
- Almost empty monochromatic quadrilaterals in planar point sets
- The multiplicity of the two smallest distances among points
- Independence numbers of random subgraphs of a distance graph
- Diameters of random distance graphs
- Independence numbers of random subgraphs of distance graphs
- An applied point pattern matching problem: Comparing 2D patterns of protein spots
- Convexity and sumsets
- On the stabbing number of a random Delaunay triangulation
- On packing \(\mathbb R^3\) with thin tori
- Piercing quasi-rectangles-on a problem of Danzer and Rogers
- Crossing-free segments and triangles in point configurations
- On tangencies among planar curves with an application to coloring L-shapes
- On levels in arrangements of surfaces in three dimensions
- New upper bound for the chromatic number of a random subgraph of a distance graph
- The Szemerédi-Trotter theorem in the complex plane
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Cardinalities of k-distance sets in Minkowski spaces
- Combinatorial spaces
- Separator theorems and Turán-type results for planar intersection graphs
- Popular distances in 3-space
- Pointed drawings of planar graphs
- On tangencies among planar curves with an application to coloring L-shapes
- Packing and covering with centrally symmetric convex disks
- A Ramsey-type result for geometric -hypergraphs
- A note on distinct distances in rectangular lattices
- Hamiltonian paths in distance graphs
- The shortest distance among points in general position.
- Six topics on inscribable polytopes
- One problem on geometric Ramsey numbers
- Computational complexity of counting coincidences
- Monotone paths in line arrangements
- On Grids in Point-Line Arrangements in the Plane
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)