State of the union (of geometric objects)
combinatorial complexityconflict-free coloringsconstructive geometryfat setsfat trianglesmolecular modelingproximity problemsroboticssmall-size \(\varepsilon\)-netsunion in a set of geometric objectsVoronoi diagrams
Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
- scientific article; zbMATH DE number 1786523
- On the complexity of the union of fat convex objects in the plane
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Improved bounds on the union complexity of fat objects
- Improved bounds for the union of locally fat objects in the plane
- On the complexity of barrier resilience for fat regions and bounded ply
- Elastic geometric shape matching for translations under the Manhattan norm
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Improved bounds on the Hadwiger-Debrunner numbers
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Union of hypercubes and 3D Minkowski sums with random sizes
- Stochastic makespan minimization in structured set systems
- The \(\varepsilon\)-\(t\)-net problem
- Near-linear approximation algorithms for geometric hitting sets
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls
- Abstract Voronoi diagrams from closed bisecting curves
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Tangencies between families of disjoint regions in the plane
- Lines avoiding balls in three dimensions revisited
- Unions of fat convex polytopes have short skeletons
- Approximation algorithms for maximum independent set of pseudo-disks
- scientific article; zbMATH DE number 1786523 (Why is no real title available?)
- Approximation algorithms for polynomial-expansion and low-density graphs
- Near-optimal lower bounds for -nets for half-spaces and low complexity set systems
- Union of random Minkowski sums and network vulnerability analysis
- Union of hypercubes and 3D Minkowski sums with random sizes
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- The number of holes in the union of translates of a convex set in three dimensions
- Limits of local search: quality and efficiency
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Local search strikes again: PTAS for variants of geometric covering and packing
- scientific article; zbMATH DE number 7765371 (Why is no real title available?)
- A note on reachability and distance oracles for transmission graphs
- On the union of cylinders in three dimensions
- Maximum Betti numbers of Čech complexes
- Abstract morphing using the Hausdorff distance and Voronoi diagrams
- On the number of incidences when avoiding an induced biclique in geometric settings
- Maximum Betti numbers of Čech complexes
- The measure of deception: an analysis of data forging in machine unlearning
- A note on smaller fractional Helly numbers
- Between shapes, using the Hausdorff distance
- On the union of -round objects in three and four dimensions
This page was built for publication: State of the union (of geometric objects)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514515)
