More output-sensitive geometric algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 695-702

  Clarkson, Kenneth L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE PROCESSING; LINEAR PROGRAMMING; NEAREST NEIGHBOR SEARCH; SET THEORY;

CONVEX HULL; EXTREME POINTS; GEOMETRIC ALGORITHM; INPUT SIZE; OUTPUT-SENSITIVE; PARTIALLY ORDERED SET; RUNNING TIME; SIMPLE++; THINNINGS; UNIT SQUARES;

COMPUTATIONAL GEOMETRY;

EID: 33747462885     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365723     Document Type: Conference Paper

References (13)

1. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom., 8:295-313, 1992.
2. J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 179-187, 1990.
3. B. Chazelle and J. Matousek. Derandomizing an output-sensitive convex hull algorithm in three dimensions. Technical report, Dept. Comput. Sci., Princeton Univ., 1992.
4. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
5. W. F. Eddy. A new convex hull algorithm for planar sets. ACM Trans. Math. Softw., 3:398-403 and 411-412, 1977.
6. M. J. Golin. Probabilistic analysis of geometric algorithms. Ph.D. thesis, Dept. Comput. Sci., Princeton Univ., Princeton, NY, 1990.
7. J. Matousek and O. Schwarzkopf. Linear optimization queries. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 16-25, 1992.
8. J. Matousek. Reporting points in halfspaces. Computational Geometry: Theory and Applications, pages 169-186, 1992.
9. J. Matousek. Linear optimization queries. J. Algorithms, 14:432-448, 1993.
10. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, Berlin, 1985.
11. G. Rote. Degenerate convex hulls in high dimensions without extra storage. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 26-32, 1992.
12. G. T. Toussaint, B. K. Bhattacharya, and R. S. Poulsen. The application of Voronoi diagrams to nonparametric decision rules. In Computer Science and Statistics: The Interface, pages 97-108, 1985.
13. G. Wilfong. Nearest neighbor problems. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 224-233, 1991.