Donald R. Chand
- 1 EGGLESTON, H.G. Convexity. Cambridge U. Press, New York and London, 1958.Google Scholar
- 2 KLEE, V. Convex polytopes and linear programming. Rep. I)1-82-0374, Boeing Scientific Research Labs., Seattle, Wash., 1964.Google Scholar
- 3 WETS, R. J.-B., AND WITZGALI,, C. Towards an algebraic characterization of convex polyhedral cones. Numer. Math. 12 (1968), 134-138.Google ScholarDigital Library
Index Terms
- An Algorithm for Convex Polytopes
Recommendations
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryGiven a set Σ of spheres in Ed, with d≥3 and d odd, having a fixed number of m distinct radii ρ1,ρ2,...,ρm, we show that the worst-case combinatorial complexity of the convex hull CHd(Σ) of Σ is Θ(Σ{1≤i≠j≤m}ninj⌊ d/2 ⌋), where ni is the number of ...
Comments