Generating random polygons with given vertices

DOI10.1016/0925-7721(95)00031-3zbMath0857.68101OpenAlexW1988912457WikidataQ56970819 ScholiaQ56970819MaRDI QIDQ1924712

Gopalakrishnan Sundaram, Chong Zhu, Joseph S. B. Mitchell, Jack Scott Snoeyink

Publication date: 3 March 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00031-3

zbMATH Keywords

geometric algorithmsrandom simple polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (19)

An exact algorithm for constructing minimum Euclidean skeletons of polygons ⋮ Computing simple paths from given points inside a polygon ⋮ On planar path transformation ⋮ Optimal area polygonization problems: exact solutions through geometric duality ⋮ Computing Simple Paths on Points in Simple Polygons ⋮ Use of simple polygonal chains in generating random simple polygons ⋮ On the Enumeration of Permutominoes ⋮ 2-Opt Moves and Flips for Area-optimal Polygonizations ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Simplifying obstacles for Steiner network problems in the plane ⋮ Connecting polygonizations via stretches and twangs ⋮ Algorithmic enumeration of surrounding polygons ⋮ Generation of random digital simple curves with artistic emulation ⋮ ON 2D SOLID α-COMPLEXES OF POISSON DISC SAMPLINGS ⋮ Reconstructing polygons from scanner data ⋮ On local transformation of polygons with visibility properties. ⋮ An experimental study of the stability problem in discrete tomography ⋮ An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets ⋮ Counting triangulations and other crossing-free structures via onion layers

Cites Work

• On the modality of convex polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• Counting convex polygons in planar point sets
• Optimal shortest path queries in a simple polygon
• Probability that \(n\) random points are in convex position
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE, II
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating random polygons with given vertices