scientific article; zbMATH DE number 2089216

MaRDI QIDQ3046485zbMATH OpenFDO

Authors Micha Sharir, Shakhar Smorodinsky

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680131.htm

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On neighbors in geometric permutations.
• Improved bounds for geometric permutations
• Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
• The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)
• Upper bounds on geometric permutations for convex sets

Cited in

(3)

• On neighbors in geometric permutations.
• On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane
• Improved bounds for geometric permutations

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