Generating random polygons with given vertices

Computational Geometry: Theory and Applications

Volumn 6, Issue 5, 1996, Pages 277-290

  Zhu, Chong ^a   Sundaram, Gopalakrishnan ^b   Snoeyink, Jack ^c   Mitchell, Joseph S B ^d  

^a MacDonald Dettwiler and Associates   (Canada)

^b ESR1   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001281932     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00031-3     Document Type: Article

References (15)

1. K. Abrahamson, On the modality of convex polygons, Discrete Comput. Geom. 5 (1990) 409-419.
2. B.N. Boots, Edge length properties of random Voronoi polygons, Metallography 20 (2) (1987) 231-236.
3. I.K. Crain, The Monte-Carlo generation of random polygons, Comput. Geosci. 4 (1978) 131-141.
4. P. Epstein and J. Sack, Generating triangulations at random, in: Proc. 4th Canad. Conf. Comput. Geom. (1992) 305-310.
5. L.J. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
6. L.J. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. Comput. Syst. Sci. 39 (2) (1989) 126-152.
7. J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica 4 (1989) 141-155.
8. H. Meijer and D. Rappaport, Upper and lower bounds for the number of monotone crossing free Hamiltonian cycles from a set of points, Ars Combin. 30 (1990) 203-208.
9. J.S.B. Mitchell, G. Rote, G. Sundaram and G. Woeginger, Counting convex polygons in planar point sets, Inform. Process. Lett. 56 (1995) 45-49.
10. R.E. Miles, Random polygons determined by random lines in a plane, Proc. Nat. Acad. Sci. 52 (1964) 901-907 and 1157-1160.
11. J. O'Rourke and M. Virmani, Generating random polygons, Technical Report 011, Smith College (1991).
12. F.P. Preparata and M.I. Shamos, Computational Geometry - An Introduction (Springer, New York, 1985).
13. G.T. Toussaint, Computing geodesic properties inside a simple polygon, Revue d'Intelligence Artificielle 3 (2) (1989) 9-42. Also available as technical report SOCS 88.20, School of Computer Science, McGill University.
14. P. Valtr, Probability that n random points are in convex position, Technical Report B 94-01, Freie Universität Berlin (January 1994).
15. J. van Leeuwen and A.A. Schoone, Untangling a traveling salesman tour in the plane, in: J.R. Mühlbacher, ed., Proc. 7th Conf. Graphtheoretic Concepts in Comput. Sci., Linz, 1981 (Hanser, München, 1982) 87-98.