On the union of cylinders in three dimensions

DOI10.1007/s00454-010-9312-xzbMath1210.52011OpenAlexW2058430377MaRDI QIDQ629833

Esther Ezra

Publication date: 10 March 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-010-9312-x

zbMATH Keywords

geometric arrangementsunion of simply-shaped bodies\((1/r)\)-cuttingslower envelopes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (3)

Lines avoiding balls in three dimensions revisited ⋮ Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ⋮ Union of hypercubes and 3D Minkowski sums with random sizes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of \(\kappa\)-round objects in three and four dimensions
• Improved bounds on the union complexity of fat objects
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• \(\epsilon\)-nets and simplex range queries
• On the complexity of a single cell in certain arrangements of surfaces related to motion planning
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• The union of congruent cubes in three dimensions
• Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
• New applications of random sampling in computational geometry
• Applications of random sampling in computational geometry. II
• Almost tight upper bounds for the single cell and zone problems in the three dimensions
• The overlay of lower envelopes and its applications
• On the union of \(\kappa\)-curved objects
• On the complexity of the union of fat convex objects in the plane
• Counting and representing intersections among triangles in three dimensions
• On the Boundary Complexity of the Union of Fat Triangles
• On the union of fat tetrahedra in three dimensions
• Fat Triangles Determine Linearly Many Holes
• The Union of Convex Polyhedra in Three Dimensions
• On Translational Motion Planning of a Convex Polyhedron in 3-Space
• The Partition Technique for Overlays of Envelopes
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Better bounds on the union complexity of locally fat objects

This page was built for publication: On the union of cylinders in three dimensions