GRP_CH Heuristic for Generating Random Simple Polygon

DOI10.1007/978-3-642-35926-2_32MaRDI QIDQ2876594zbMATH OpenOpenAlexFDO

Authors Sanjib Sadhu, Subhashis Hazarika, Kapil Kumar Jain, Saurav Basu, Tanmay De

Publication date 19 August 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35926-2_32

zbMATH Keywords

convex hullsimple polygonvisibility of a line segment

Mathematics Subject Classification ID

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

Recommendations

• Use of simple polygonal chains in generating random simple polygons
• Computing and Combinatorics
• A fast ergodic algorithm for generating ensembles of equilateral random polygons
• The generation of random equilateral polygons
• Generating equilateral random polygons in confinement
• A sweep-plane algorithm for generating random tuples in simple polytopes
• Generating equilateral random polygons in confinement. II
• Generating random polygons with given vertices
• Generating equilateral random polygons in confinement. III
• A randomized algorithm for triangulating a simple polygon in linear time

Cited in

(2)

• An empirical study on randomized optimal area polygonization of planar point sets
• Use of simple polygonal chains in generating random simple polygons

This page was built for publication: GRP_CH Heuristic for Generating Random Simple Polygon

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