Use of simple polygonal chains in generating random simple polygons

DOI10.1007/S13160-017-0258-8MaRDI QIDQ2400166zbMATH OpenOpenAlexFDO

Authors Ali Nourollah, Mohsen Movahedinejad

Publication date 28 August 2017

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-017-0258-8

zbMATH Keywords

computational geometrysimple polygonal chainsimple polygon generation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Generating random polygons with given vertices
• GRP_CH Heuristic for Generating Random Simple Polygon
• Generating triangulations at random
• Computing and Combinatorics
• A randomized algorithm for triangulating a simple polygon in linear time

Cites work

• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• scientific article; zbMATH DE number 1032051 (Why is no real title available?)
• Computational geometry. Algorithms and applications.
• Generating random polygons with given vertices
• Generating triangulations at random

Cited in

(2)

• An equivalence diagram of star partitioning and simple polygons generation
• GRP_CH Heuristic for Generating Random Simple Polygon

This page was built for publication: Use of simple polygonal chains in generating random simple polygons

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