New lower bounds for convex hull problems in odd dimensions

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1198-1214

  Erickson, Jeff ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DECISION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

ADVERSARY ARGUMENTS; CONVEX HULL PROBLEMS; CONVEX POLYTOPES; DECISION TREES; DEGENERACY;

COMPUTATIONAL GEOMETRY;

EID: 0032643328     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797315410     Document Type: Article

References (50)

1. P. K. AGARWAL AND J. MATOUŠEK, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
2. N. M. AMATO AND E. A. RAMOS, On computing Voronoi diagrams by divide-prune-and-conquer, in Proceedings of the 12th ACM Sympos. Comput. Geom., Philadelphia, PA, 1996, pp. 166-175.
3. N. AMENTA AND G. ZIEGLER, Deformed products and maximal shadows of polytopes, Report 502-1996, Technische Univesität Berlin, May 1996. In Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Gooman, and R. Pollack, eds., American Mathematical Society, Providence, RI, 1999, pp. 57-90 (full version of [4]).
4. N. AMENTA AND G. ZIEGLER, Shadows and slices of polytopes, in Proceedings of the 12th ACM Sympos. Comput. Geom., Philadelphia, PA, 1996, pp. 10-19.
5. D. AVIS, D. BREMNER, AND R. SEIDEL, How good are convex hull algorithms?, Comput. Geom. Theory Appl., 7 (1997), pp. 265-302.
6. D. AVIS AND K. FUKUDA, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom., 8 (1992), pp. 295-313.
7. M. BEN-OR, Lower bounds for algebraic computation trees, in Proceedings of the 15th ACM Sympos. Theory Comput., Boston, MA, 1983, pp. 80-86.
8. 2-hard problems?, SIGACT News, 25 (1994), pp. 83-85.
9. S. A. BURR, B. GRÜNBAUM, AND N. J. A. SLOANE, The orchard problem, Geom. Dedicata, 2 (1974), pp. 397-424.
10. T. M. CHAN, Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete Comput. Geom., 16 (1996), pp. 361-368.
11. T. M. CHAN, Output-sensitive results on convex hulls, extreme points, and related problems, Discrete Comput. Geom., 16 (1996), pp. 369-387.
12. T. M. CHAN, J. SNOEYINK, AND C.-K. YAP, Primal dividing and dual pruning: Output-sensitive construction of 4-d polytopes and 3-d Voronoi diagrams, Discrete Comput. Geom., 18 (1997), pp. 433-454.
13. D. R. CHAND AND S. S. KAPUR, An algorithm for convex polytopes, J. Assoc. Comput. Mach., 17 (1970), pp. 78-86.
14. R. CHANDRASEKARAN, S. N. KABADI, AND K. G. MURTY, Some NP-complete problems in linear programming, Oper. Res. Lett., 1 (1982), pp. 101-104.
15. B. CHAZELLE, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom., 10 (1993), pp. 377-409.
16. B. CHAZELLE AND J. MATOUŠEK, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Comput. Geom., 5 (1995), pp. 27-32.
17. K. L. CLARKSON, More output-sensitive geometric algorithms, in Proceedings of the 35th IEEE Sympos. Found. Comput. Sci., Santa Fe, NM, 1994, pp. 695-702.
18. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
19. M. E. DYER, The complexity of vertex enumeration methods, Math. Oper. Res., 8 (1983), pp. 381-402.
20. P. ERDOS AND G. PURDY, Two combinatorial problems in the plane, Discrete Comput. Geom., 13 (1995), pp. 441-443.
21. J. ERICKSON, Lower bounds for linear satisfiability problems, in Proceedings of the 6th ACM-SIAM Sympos. Discrete Algorithms, San Francisco, CA, 1995, pp. 388-395. Chicago J. Theoret. Comput. Sci., to appear.
22. J. ERICKSON, New lower bounds for convex hull problems in odd dimensions, in Proceedings of the 12th ACM Sympos. Comput. Geom., Philadelphia, PA, 1996, pp. 1-9.
23. J. ERICKSON AND R. SEIDEL, Better lower bounds on detecting affine and spherical degeneracies, Discrete Comput. Geom., 13 (1995), pp. 41-57.
24. J. ERICKSON AND R. SEIDEL, Erratum to "Better lower bounds on detecting affine and spherical degeneracies," Discrete Comput. Geom., 18 (1997), pp. 239-240.
25. Z. FÜREDI AND I. PALÁSTI, Arrangements of lines with a large number of triangles, Proceedings of the Amer. Math. Soc., 92 (1984), pp. 561-566.
26. 2) problems in computational geometry, Comput. Geom. Theory Appl., 5 (1995), pp. 165-185.
27. D. GALE, Neighborly and cyclic polytopes, in Convexity, V. Klee, ed., in Proceedings of the Sympos. Pure Math. VII, Amer. Math. Soc., Providence, RI, 1963, pp. 225-232.
28. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
29. R. L. GRAHAM, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett., 1 (1972), pp. 132-133.
30. B. GRÜNBAUM, Convex Polytopes, John Wiley, New York, 1967. Rev. ed., V. Klee and P. Kleinschmidt, ed., Graduate Texts in Math., Springer-Verlag, New York, in preparation.
31. B. GRÜNBAUM, Arrangements and Spreads, Regional Conf. Ser. Math. 10, Amer. Math. Soc., Providence, 1972.
32. C. G. J. JACOBI, De functionibus alternantibus earumque divisione per productum e differentiis elementorum conflatum, J. Reine Angew. Mathematik, 22 (1841), pp. 360-371. Reprinted in Gesammelten Werke III, G. Reimer, Berlin, 1884.
33. C. G. J. JACOBI, De functionibus alternantibus earumque divisione per productum e differentiis elementorum conflatum, J. Reine Angew. Mathematik, 22 (1841), pp. 360-371. Reprinted in Gesammelten Werke III, G. Reimer, Berlin, 1884.
34. L. KHACHIYAN, On the complexity of approximating determinants in matrices, J. Complexity, 11 (1995), pp. 138-153.
35. D. G. KIRKPATRICK AND R. SEIDEL, The ultimate planar convex hull algorithm?, SIAM J. Comput. 15 (1986), pp. 287-299.
36. J. MATOUŠEK, Linear optimization queries, J. Algorithms, 14 (1993), pp. 432-448.
37. J. MATOUŠEK AND O. SCHWARZKOPF, On ray shooting in convex polytopes, Discrete Comput. Geom., 10 (1993), pp. 215-232.
38. N. MEGIDDO, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach., 31 (1984), pp. 114-127.
39. F. P. PREPARATA AND S. J. HONG, Convex hulls of finite sets of points in two and three dimensions, Commun. ACM, 20 (1977), pp. 87-93.
40. G. ROTE, Degenerate convex hulls in high dimensions without extra storage, in Proceedings of the 8th ACM Sympos. Comput. Geom., Berlin, Germany, 1992, pp. 26-32.
41. I. SCHUR, Über eine Klasse von Matrizen, die sich einer gegebenen Matrix zuordnen lassen, thesis, Berlin, 1901. Reprinted in Gesammelte Abhandlungen, Springer, 1973.
42. R. SEIDEL, A convex hull algorithm optimal for point sets in even dimensions, M.S. thesis, Dept. Comput. Sci., Univ. British Columbia, Vancouver, BC, 1981.
43. R. SEIDEL, A method for proving lower bounds for certain geometric problems, in Computational Geometry, G. T. Toussaint, ed., North-Holland, Amsterdam, 1985, pp. 319-334.
44. R. SEIDEL, Constructing higher-dimensional convex hulls at logarithmic cost per face, in Proceedings of the 18th ACM Sympos. Theory Comput., Berkeley, CA, 1986, pp. 404-413.
45. R. SEIDEL, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom., 6 (1991), pp. 423-434.
46. R. SEIDEL, Convex hull computations, in Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds., CRC Press LLC, Boca Raton, FL, 1997, pp. 361-376.
47. J. STOLFI, Oriented Projective Geometry: A Framework for Geometric Computations, Academic Press, New York, 1991.
48. G. F. SWART, Finding the convex hull facet by facet, J. Algorithms, 6 (1985), pp. 17-48.
49. A. C. YAO, A lower bound to finding convex hulls, J. Assoc. Comput. Mach., 28 (1981), pp. 780-787.
50. G. M. ZIEGLER, Lectures on Polytopes, Graduate Texts in Math. 152, Springer-Verlag, New York, 1994.