Generation of convex polygons with individual angular constraints - ScienceDirect

Information Processing Letters

Volume 24, Issue 3, 13 February 1987, Pages 159-164

Information Processing Letters

https://doi.org/10.1016/0020-0190(87)90179-7 Get rights and content

Abstract

We derive an algorithm of complexity O(n) to randomly generate convex polygons with n edges optionally imposing individual angular constraints.

References (5)

H. Abelson et al.
Turtle Geometry: The Computer as a Medium for Exploring Mathematics
(1981)
E.W. Dijkstra
A Discipline of Programming
(1976)

There are more references available in the full text version of this article.

Cited by (2)

An optimal algorithm for realizing a Delaunay triangulation
1997, Information Processing Letters
A Bibliography on Digital and Computational Convexity (1961-1988)
1989, IEEE Transactions on Pattern Analysis and Machine Intelligence

Copyright © 1987 Published by Elsevier B.V.