Three problems about simple polygons

Computational Geometry: Theory and Applications

Volumn 35, Issue 3, 2006, Pages 209-217

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Convex hull; Geometric optimization; Polygon triangulation

Indexed keywords

EID: 84867959708     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.11.002     Document Type: Article

References (37)

1. P.K. Agarwal, and M. Sharir Davenport-Schinzel Sequences and Their Geometric Applications 1995 Cambridge University Press New York
2. P.K. Agarwal, and M. Sharir Efficient algorithms for geometric optimization ACM Comput. Surv. 30 1998 412 458
3. L. Aleksandrov, and H. Djidjev Linear algorithms for partitioning embedded graphs of bounded genus SIAM J. Discrete Math. 9 1996 129 150
4. N.M. Amato, M.T. Goodrich, and E.A. Ramos A randomized algorithm for triangulating a simple polygon in linear time Discrete Comput. Geom. 26 2001 245 265
5. R. Bar-Yehuda, and B. Chazelle Triangulating disjoint Jordan chains Internat. J. Comput. Geom. Appl. 4 1994 475 481
6. S. Bespamyatnikh, Efficient algorithm for finding two largest empty circles, in: 15th European Workshop on Comput. Geom., 1999, pp. 37-38
7. S. Bespamyatnikh Packing two disks in a polygon Computational Geometry 23 2002 31 42
8. B.K. Bhattacharya, and H. ElGindy A new linear convex hull algorithm for simple polygons IEEE Trans. Inform. Theory IT-30 1984 85 88
9. T.C. Biedl, E.D. Demaine, M.L. Demaine, A. Lubiw, G.T. Toussaint, Hiding disks in folded polygons, in: Proc. 10th Canad. Conf. Comput. Geom., 1998
10. P. Bose, J. Czyzowicz, E. Kranakis, and A. Maheshwari Algorithms for packing two circles in a convex polygon Proc. Japan Conf. Discrete Comput. Geom. Lecture Note Comput. Sci. vol. 1763 2000 Springer-Verlag Berlin 93 103
11. P. Bose, P. Morin, and A. Vigneron Packing two disks into a polygonal environment J. Discrete Algorithms 2 2004 373 380
12. T.M. Chan Geometric applications of a randomized optimization technique Discrete Comput. Geom. 22 1999 547 567
13. B. Chazelle Triangulating a simple polygon in linear time Discrete Comput. Geom. 6 1991 485 524
14. B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacristán, and M. Teillaud Splitting a Delaunay triangulation in linear time Algorithmica 34 2002 39 46
15. F. Chin, J. Snoeyink, and C.A. Wang Finding the medial axis of a simple polygon in linear time Discrete Comput. Geom. 21 1999 405 420
16. K.L. Clarkson, and P.W. Shor Applications of random sampling in computational geometry, II Discrete Comput. Geom. 4 1989 387 421
17. K.L. Clarkson, R.E. Tarjan, and C.J. Van Wyk A fast Las Vegas algorithm for triangulating a simple polygon Discrete Comput. Geom. 4 1989 423 432
18. logn) algorithms for difficult Ω (n) problems Internat. J. Comput. Geom. Appl. 2 1992 97 111
19. K.Y. Fung, T.M. Nicholl, R.E. Tarjan, and C.J. Van Wyk Simplified linear-time Jordan sorting and polygon clipping Inform. Process. Lett. 35 1990 85 92
20. M.T. Goodrich Planar separators and parallel polygon triangulation J. Comput. Sys. Sci. 51 1995 374 389
21. R.L. Graham, and F.F. Yao Finding the convex hull of a simple polygon J. Algorithms 4 1983 324 331
22. logn) time Computational Geometry 11 1998 175 185
23. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, and R.E. Tarjan Sorting Jordan sequences in linear time using level-linked search trees Inform. Control 68 1986 170 184
24. S.K. Kim, C.-S. Shin, and T.-C. Yang Placing two disks in a convex polygon Inform. Process. Lett. 73 2000 33 39
25. D.G. Kirkpatrick Optimal search in planar subdivisions SIAM J. Comput. 12 1983 28 35
26. D.G. Kirkpatrick, M. Klawe, and R.E. Tarjan Polygon triangulation in O (nloglogn) time with simple data structures Discrete Comput. Geom. 7 1992 329 346
27. R. Klein, and A. Lingas Fast skeleton construction Proc. 3rd European Sympos. Algorithms Lecture Notes Comput. Sci. vol. 979 1995 Springer-Verlag Berlin 582 595
28. D.T. Lee On finding the convex hull of a simple polygon Internat. J. Comput. Inform. Sci. 12 1983 87 98
29. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM J. Appl. Math. 32 1979 177 189
30. D. McCallum, and D. Avis A linear algorithm for finding the convex hull of a simple polygon Inform. Process. Lett. 9 1979 201 206
31. N. Megiddo Applying parallel computation algorithms to the design of serial algorithms J. ACM 30 1983 852 865
32. A. Melkman On-line construction of the convex hull of a simple polyline Inform. Process. Lett. 25 1987 11 12
33. K. Mulmuley Computational Geometry: An Introduction Through Randomized Algorithms 1994 Prentice-Hall Englewood Cliffs, NJ
34. F. Nielsen, and M. Yvinec An output-sensitive convex hull algorithm for planar convex objects Internat. J. Comput. Geom. Appl. 8 1998 39 66
35. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer-Verlag New York
36. R. Seidel A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Computational Geometry 1 1991 51 64
37. R.E. Tarjan Data Structures and Network Algorithms 1983 SIAM Philadelphia, PA