scientific article; zbMATH DE number 7662166
From MaRDI portal
Publication:5881548
DOI10.57717/CGT.V1I1.18MaRDI QIDQ5881548
Unnamed Author, Patrick Schnider
Publication date: 10 March 2023
Full work available at URL: https://arxiv.org/abs/2002.06947
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal partition trees
- A new topological Helly theorem and some transversal results
- Piercing numbers for balanced and unbalanced families
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- Über eine Variante zum Hellyschen Satz
- Greedoids
- The theory of convex geometries
- d-collapsing and nerves of families of convex sets
- On range searching with semialgebraic sets
- Improved bounds on the Hadwiger-Debrunner numbers
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- Geometric applications of a randomized optimization technique
- New lower bounds for Hopcroft's problem
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Transversal numbers for hypergraphs arising in geometry
- On a class of \(O(n^ 2)\) problems in computational geometry
- Stabbing pairwise intersecting disks by five points
- Convexity in cristallographical lattices
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Transversal numbers over subsets of linear spaces
- Starshaped Unions and Nonempty Intersections of Convex Sets in R d
- Algorithms for Reporting and Counting Geometric Intersections
- Piercing convex sets
- Convex sets in the plane with three of every four meeting
This page was built for publication:
