Generating random polygons with given vertices

DOI10.1016/0925-7721(95)00031-3MaRDI QIDQ1924712zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chong Zhu, Gopalakrishnan Sundaram, Joseph S. B. Mitchell, Jack 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)

Recommendations

• Use of simple polygonal chains in generating random simple polygons
• Generating triangulations at random
• Computing and Combinatorics
• GRP_CH Heuristic for Generating Random Simple Polygon
• Generating random points in a polytope

Cites work

• An optimal visibility graph algorithm for triangulated simple polygons
• Counting convex polygons in planar point sets
• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• scientific article; zbMATH DE number 11985 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On the modality of convex polygons
• 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

Cited in

(25)

• Computing simple paths from given points inside a polygon
• On local transformation of polygons with visibility properties.
• Connecting polygonizations via stretches and twangs
• Algorithmic enumeration of surrounding polygons
• An exact algorithm for constructing minimum Euclidean skeletons of polygons
• Optimal area polygonization problems: exact solutions through geometric duality
• Generation of random digital simple curves with artistic emulation
• Counting triangulations and other crossing-free structures via onion layers
• On planar path transformation
• Use of simple polygonal chains in generating random simple polygons
• Random generation of \(Q\)-convex sets
• GRP_CH Heuristic for Generating Random Simple Polygon
• Generating equilateral random polygons in confinement. II
• On the enumeration of permutominoes
• An experimental study of the stability problem in discrete tomography
• Few points to generate a random polytope
• Generating triangulations at random
• ON 2D SOLID α-COMPLEXES OF POISSON DISC SAMPLINGS
• 2-opt moves and flips for area-optimal polygonizations
• Area-optimal simple polygonalizations: the CG challenge 2019
• An empirical study on randomized optimal area polygonization of planar point sets
• Computing Simple Paths on Points in Simple Polygons
• Reconstructing polygons from scanner data
• Computational Science and Its Applications – ICCSA 2004
• Simplifying obstacles for Steiner network problems in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924712)