scientific article; zbMATH DE number 6832267

DOI10.4230/LIPICS.SOCG.2016.10MaRDI QIDQ3132843zbMATH OpenFDO

Authors Michael Gene Dobbins, Xavier Goaoc, Boris Aronov, Otfried Cheong

Publication date 30 January 2018

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

zbMATH Keywords

motion planningconvex setsunion complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Artificial intelligence for robotics (68T40)

Recommendations

• The number of holes in the union of translates of a convex set in three dimensions
• On convex holes in d-dimensional point sets
• Transversal numbers of translates of a convex body
• Holes in 2-convex point sets
• Holes in 2-convex point sets
• On the number of minimal pairs of compact convex sets that are not translates of one another
• Lower bounds for the number of small convex \(k\)-holes
• The characterization of cones as pointsets with 3 intersection numbers
• The Number of Three-Dimensional Convex Polyhedra
• Convex hulls of indicatrices and singularities of the transitivity zone in \(\mathbb R^3\)

Cited in

(2)

• Large sets moving through a ``narrow hole
• The number of holes in the union of translates of a convex set in three dimensions

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