Generating random polygons with given vertices
- 30 September 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (5) , 277-290
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Counting convex polygons in planar point setsInformation Processing Letters, 1995
- On the modality of convex polygonsDiscrete & Computational Geometry, 1990
- Optimal shortest path queries in a simple polygonJournal of Computer and System Sciences, 1989
- An optimal visibility graph algorithm for triangulated simple polygonsAlgorithmica, 1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Edge length properties of random Voronoi polygonsMetallography, 1987
- The Monte-Carlo generation of random polygonsComputers & Geosciences, 1978