F. Aurenhammer
- 1.M.L. Fredlnun, How good is the information theory bound in sorting ?, Theteoret. Comput. Sci., 1 (1976) ) pp. 355- 361.Google Scholar
Cross Ref
- 2.P. Roscrstichl, Planar permutations defined by two intersecting Jordan curves, in Graph theory and Combinatorics, Academic Press, London, 1 984.Google Scholar
- 3.K. Hoffmann, K. Mchlhorn, P. Rosenstiehl, and R.E. Tarjan, Sorting Jordan sequences in linear time using Ievel- Iinked scarch trees, Informantion and Control,68 (1986), pp. 170--184. Google ScholarDigital Library
- 4.H. Kdclsbrunner, Arrnngoments and Geomteric Computation, forthcoming book, Springer.Google Scholar
Index Terms
- Jordan sorting via convex hulls of certain non-simple polygons
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 ...
Packing convex polygons in minimum-perimeter convex hulls
AbstractThe problem of packing a given set of freely translated and rotated convex polygons in a minimum-perimeter convex polygon (in particular the minimum-perimeter convex hull) is introduced. A mathematical model of the problem using the phi-function ...
Comments