scientific article; zbMATH DE number 1749054

zbMath0999.52006MaRDI QIDQ4530626

Publication date: 4 June 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

arrangements polyhedra convex sets transversals combinatorial geometry convex polytopes geometric configurations

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Other problems of combinatorial convexity (52A37) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Related Items (only showing first 100 items - show all)

Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching ⋮ On the rectilinear crossing number of complete uniform hypergraphs ⋮ Metric Characterizations of Some Classes of Banach Spaces ⋮ A semi-algebraic version of Zarankiewicz's problem ⋮ Approximation and inapproximability results for maximum clique of disc graphs in high dimensions ⋮ Carathéodory, Helly and the others in the max-plus world ⋮ Limitations to Fréchet's metric embedding method ⋮ A note on approximation of a ball by polytopes ⋮ On some monotone path problems in line arrangements ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Near equipartitions of colored point sets ⋮ How to play hot and cold ⋮ The VC-dimension of K-vertex D-polytopes ⋮ Outer normal transforms of convex polytopes ⋮ Tverberg-type theorems with altered intersection patterns (nerves) ⋮ Carathéodory's theorem in depth ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Near isometric terminal embeddings for doubling metrics ⋮ Convex analysis in groups and semigroups: a sampler ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Bracketing numbers of convex and \(m\)-monotone functions on polytopes ⋮ On the \(k\)-means/median cost function ⋮ On embeddings of locally finite metric spaces into \(\ell_p\) ⋮ A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model ⋮ Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Further consequences of the colorful Helly hypothesis ⋮ A crossing lemma for multigraphs ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ On a characterization of lattice cubes via discrete isoperimetric inequalities ⋮ Theorems of Carathéodory, Helly, and Tverberg without dimension ⋮ The right acute angles problem? ⋮ Characterizing unpredictable patterns in wireless sensor network data ⋮ Berge's theorem, fractional Helly, and art galleries ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ Homogeneous selections from hyperplanes ⋮ On the 2-colored crossing number ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ Higher-order Erdős-Szekeres theorems ⋮ Analysis and design of discrete-time linear systems with nested actuator saturations ⋮ Random polytopes and the wet part for arbitrary probability distributions ⋮ On random generation of fuzzy measures ⋮ A proof of the Oja depth conjecture in the plane ⋮ Real-reward testing for probabilistic processes ⋮ Large cliques in hypergraphs with forbidden substructures ⋮ Equivelar toroids with few flag-orbits ⋮ On the speed of algebraically defined graph classes ⋮ Upper bounds for stabbing simplices by a line ⋮ On the 3-distortion of a path ⋮ A simple proof for open cups and caps ⋮ Optimal distortion embeddings of distance regular graphs into Euclidean spaces ⋮ On discrete Brunn-Minkowski and isoperimetric type inequalities ⋮ Quantitative fractional Helly and \((p,q)\)-theorems ⋮ A combinatorial property of points and balls, a colored version ⋮ Counting with rational generating functions ⋮ Colourful and fractional \((p,q)\)-theorems ⋮ Dimension reduction by random hyperplane tessellations ⋮ Covering paths for planar point sets ⋮ An optimal randomized algorithm for \(d\)-variate zonoid depth ⋮ Pure point diffractive substitution Delone sets have the Meyer property ⋮ Isometric embedding of Busemann surfaces into \(L_1\) ⋮ Recursive geometry of the flow complex and topology of the flow complex filtration ⋮ Inequalities for distances between points and distance preserving mappings ⋮ Unnamed Item ⋮ An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ The isotropic constant of random polytopes with vertices on convex surfaces ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ A Danzer set for axis parallel boxes ⋮ The number of disk graphs ⋮ A positive fraction mutually avoiding sets theorem ⋮ Common transversals in the plane: The fractional perspective ⋮ On some covering problems in geometry ⋮ Book Review: Metric embeddings: bilipschitz and coarse embedddings into Banach spaces ⋮ Computing a Nonnegative Matrix Factorization---Provably ⋮ Large Area Convex Holes in Random Point Sets ⋮ Cutting lemma and Zarankiewicz's problem in distal structures ⋮ Constructions for the Elekes-Szabó and Elekes-Rónyai problems ⋮ Planar lattices and equilateral polygons ⋮ The Erdős-Szekeres Problem ⋮ Kirszbraun-type theorems for graphs ⋮ The Arithmetic Tutte polynomial of two matrices associated to Trees ⋮ Embeddability of locally finite metric spaces into Banach spaces is finitely determined ⋮ Faster algorithms for growing prioritized disks and rectangles ⋮ Probabilistic pursuits on graphs ⋮ Metric structures in \(L_1\): dimension, snowflakes, and average distortion ⋮ Packing plane spanning graphs with short edges in complete geometric graphs ⋮ Integer cells in convex sets ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Sunflowers of convex open sets ⋮ Monotone maps, sphericity and bounded second eigenvalue ⋮ Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons ⋮ Topology of geometric joins ⋮ Sets with few distinct distances do not have heavy lines ⋮ Optimal bounds for the colored Tverberg problem ⋮ On Lipschitz extension from finite subsets

This page was built for publication: