Jeff Erickson  Home/Search
Context Related
| siam.org/sambin/getfile/S...31541.ps.Z From: siam.org/sambin/dbq/arti...31541 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that in the worst case,## n #d/2#-1 +n log n) sidedness queries are required to determine whether the convex hull of n points in R^d is simplicial or to determine the number of convex hull facets. This lower bound matches known upper bounds in any odd dimension. Our result follows from a straightforward adversary argument. A key step in the proof is the construction of a quasi-simplicial n-vertex polytope with## n #d/2#-1) degenerate facets. While it has been known for several years... (Update)
Cited by: More
Computational Geometry and Discrete Computations - Devillers (1998) (Correct)
Shape Fitting with Outliers - Har-Peled, Wang (2003) (Correct)
Fast Algorithms for Computing the Smallest k-Enclosing Disc - Har-Peled, Mazumdar (2003) (Correct)
Similar documents (at the sentence level):
53.1%: New Lower Bounds for Convex Hull Problems in Odd Dimensions - Erickson (1996) (Correct)
31.6%: Lower Bounds for Fundamental Geometric Problems - Erickson (1996) (Correct)
26.1%: New Lower Bounds for Convex Hull Problems in Odd Dimensions.. - Erickson (1995) (Correct)
Active bibliography (related documents): More All
0.8: Lower Bounds for Linear Satisfiability Problems - Erickson (1999) (Correct)
0.5: Lower Bounds In A Parallel Model Without Bit Operations - Mulmuley (1999) (Correct)
0.4: Smallest Color-Spanning Objects - Abellanas, Hurtado Diaz, Icking.. (2001) (Correct)
Similar documents based on text: More All
0.1: Better Lower Bounds on Detecting Affine and Spherical.. - Erickson, Seidel (1995) (Correct)
0.1: Hulls For Various Kinds Of alpha-Completeness In Archimedean.. - Hager, Martinez (Correct)
Related documents from co-citation: More All
4: On geometric optimization with few violated constraints - Matousek - 1995
4: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
4: Lower bounds for linear satisfiability problems - Erickson - 1995
BibTeX entry: (Update)
J. Erickson. New lower bounds for convex hull problems in odd dimensions. In Proc. 12th Ann. ACM Symp. Comput. Geom., pages 1--9, 1996. http://citeseer.ist.psu.edu/erickson99new.html More
@article{ erickson99new,
author = "Jeff Erickson",
title = "New Lower Bounds for Convex Hull Problems in Odd Dimensions",
journal = "SIAM J. Comput.",
volume = "28",
number = "4"
pages = "1198--1214",
year = "1999",
url = "citeseer.ist.psu.edu/erickson99new.html" }
Citations (may not include all citations):335 Applications of random sampling in computational geometry<F - Clarkson, Shor - 1989
122 Linear programming in linear time when the dimension is<F (context) - Megiddo - 1984
74 A pivoting algorithm for convex hulls and vertex enumeration.. (context) - Avis, Fukuda - 1992
69 Small-dimensional linear programming and convex hulls made<F (context) - Seidel - 1991
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986
54 Output-sensitive results on convex hulls (context) - Chan - 1996
53 Oriented Projective Geometry: A Framework for Geometric<F (context) - Stolfi - 1991
25 Primal dividing and dual pruning: Output-sensitive construct.. - Chan, Snoeyink et al. - 1997
24 Derandomizing an output-sensitive convex hull algorithm in t.. (context) - Chazelle, Matou et al. - 1995
22 Optimal output-sensitive convex hull algorithms in two and t.. - Chan - 1996
21 problems in computational geometry (context) - Gajentaan, Overmars et al. - 1995
14 cient algorithm for determining the convex hull of a finite .. (context) - Graham, An - 1972
11 On computing Voronoi diagrams by divide-prune-andconquer - Amato, Ramos - 1996
11 Computers and Intractability: A Guide to the Theory of (context) - Garey, Johnson - 1979
10 Degenerate convex hulls in high dimensions without extra<F - Rote - 1992
10 Graduate Texts in Math (context) - Ziegler, Lectures et al. - 1994
9 De functionibus alternantibus earumque divisione per product.. (context) - Jacobi
5 Better lower bounds on detecting a#ne and spherical degenera.. (context) - Erickson, Seidel et al. - 1997
5 Better lower bounds on detecting a#ne and spherical<F (context) - Erickson, Seidel - 1995
2 Lower bounds for algebraic computation<F (context) - Ben-Or - 1983
2 Gr unbaum (context) - Burr - 1974
1 Ray shooting and parametric<F (context) - Agarwal, Matou et al. - 1993
1 How good are convex hull<F (context) - Avis, Bremner et al. - 1997
1 Shadows and slices of (context) - Amenta, Ziegler - 1996
1 A convex hull algorithm optimal for point sets in even<F (context) - Seidel - 1981
1 An algorithm for convex<F (context) - Chand, Kapur - 1970
1 A method for proving lower bounds for certain geometric<F (context) - Seidel - 1985
1 Some NP-complete problems in linear<F (context) - Chandrasekaran, Kabadi et al. - 1982
1 How hard are<F (context) - Bloch, Buss et al. - 1994
1 An optimal convex hull algorithm in any fixed<F (context) - Chazelle - 1993
1 New lower bounds for convex hull problems in odd<F (context) - Erickson - 1996
1 Arrangements of lines with a large number of (context) - uredi, Pal et al. - 1984
1 Neighborly and cyclic<F (context) - Gale - 1963
1 Convex hull<F (context) - Seidel - 1997
1 More output-sensitive geometric<F (context) - Clarkson - 1994
1 Finding the convex hull facet by<F (context) - Swart - 1985
1 the complexity of approximating determinants in<F (context) - Khachiyan, On - 1995
1 A lower bound to finding convex<F (context) - Yao - 1981
1 The ultimate planar convex hull<F (context) - Kirkpatrick, Seidel - 1986
1 The complexity of vertex enumeration<F (context) - Dyer - 1983
1 Linear optimization<F (context) - Matou, sek - 1993
1 Two combinatorial problems in the<F (context) - os, Purdy - 1995
1 On ray shooting in convex<F (context) - sek, Schwarzkopf - 1993
1 Lower bounds for linear satisfiability<F (context) - Erickson - 1995
1 Arrangements and<F (context) - Gr, unbaum - 1972
1 Convex hulls of finite sets of points in two and three<F (context) - Preparata, Hong - 1977
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC