scientific article; zbMATH DE number 7662166

DOI10.57717/CGT.V1I1.18MaRDI QIDQ5881548zbMATH OpenFDO

Authors Patrick Schnider

Publication date 10 March 2023

Full work available at URL https://arxiv.org/abs/2002.06947

zbMATH Keywords

\((p, q)\)-theoremcomputational geometryconvex setsHellyrange searchingstabbing

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Piercing convex sets
• Improved bounds on the Hadwiger-Debrunner numbers
• On a problem of Danzer
• Stabbing Convex Polygons with a Segment or a Polygon

Cites work

• A new topological Helly theorem and some transversal results
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• Algorithms for Reporting and Counting Geometric Intersections
• Convex sets in the plane with three of every four meeting
• Convexity in cristallographical lattices
• d-collapsing and nerves of families of convex sets
• Geometric applications of a randomized optimization technique
• Greedoids
• Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
• scientific article; zbMATH DE number 4017764 (Why is no real title available?)
• scientific article; zbMATH DE number 3915112 (Why is no real title available?)
• scientific article; zbMATH DE number 3971629 (Why is no real title available?)
• scientific article; zbMATH DE number 3770461 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 2209723 (Why is no real title available?)
• Improved bounds on the Hadwiger-Debrunner numbers
• Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
• New lower bounds for Hopcroft's problem
• On a class of \(O(n^ 2)\) problems in computational geometry
• On range searching with semialgebraic sets
• On weak -nets and the Radon number
• Optimal partition trees
• Piercing convex sets
• Piercing numbers for balanced and unbalanced families
• Reporting intersecting pairs of convex polytopes in two and three dimensions
• Stabbing pairwise intersecting disks by five points
• Starshaped Unions and Nonempty Intersections of Convex Sets in R d
• The theory of convex geometries
• Transversal numbers for hypergraphs arising in geometry
• Transversal numbers over subsets of linear spaces
• Über eine Variante zum Hellyschen Satz

Cited in

(4)

• Stabbing pairwise intersecting disks by five points
• On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
• scientific article; zbMATH DE number 842885 (Why is no real title available?)
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2

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 Q5881548)