Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons.}, author = {Sohler, Christian}, booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)}, pages = {174--177}, title = {{Generating Random Star-Shaped Polygons}}, year = {1999}, }