Improved bounds on the union complexity of fat objects
From MaRDI portal
Publication:946687
DOI10.1007/S00454-007-9029-7zbMATH Open1158.68048OpenAlexW2170429689MaRDI QIDQ946687FDOQ946687
Authors: Mark de Berg 
Publication date: 24 September 2008
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-007-9029-7
Recommendations
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Improved bounds for the union of locally fat objects in the plane
- Better bounds on the union complexity of locally fat objects
- On the complexity of the union of fat convex objects in the plane
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- On the union of fat wedges and separating a collection of segments by a line
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Title not available (Why is that?)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- The complexity of the free space for a robot moving amidst fat obstacles
- Fat Triangles Determine Linearly Many Holes
- The union of congruent cubes in three dimensions
- On the union of \(\kappa\)-round objects in three and four dimensions
- Sharp quantum versus classical query complexity separations
- On fat partitioning, fat covering and the union size of polygons
- The complexity of the free space for motion planning amidst fat obstacles
- On the Boundary Complexity of the Union of Fat Triangles
- Efficient hidden surface removal for objects with small union size
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Computing depth orders for fat objects and related problems
- Vertical ray shooting and computing depth orders for fat objects
- Vertical ray shooting for fat objects
Cited In (20)
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- Approximation algorithms for polynomial-expansion and low-density graphs
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On the complexity of barrier resilience for fat regions and bounded ply
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Unions of fat convex polytopes have short skeletons
- On the union of cylinders in three dimensions
- A note on the perimeter of fat objects
- Approximating the Fréchet distance for realistic curves in near linear time
- State of the union (of geometric objects)
- Computing the visibility map of fat objects
- Title not available (Why is that?)
- Better bounds on the union complexity of locally fat objects
- Decompositions and boundary coverings of non-convex fat polyhedra
- Improved bounds for the union of locally fat objects in the plane
- On the complexity of the union of fat convex objects in the plane
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
This page was built for publication: Improved bounds on the union complexity of fat objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946687)
