Generation of convex polygons with individual angular constraints

DOI10.1016/0020-0190(87)90179-7zbMath0653.68027OpenAlexW2070682356MaRDI QIDQ1107995

S. H. Smith

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90179-7

zbMATH Keywords

complexitycomputational geometryconvex polygon generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

An optimal algorithm for realizing a Delaunay triangulation

Cites Work

• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of convex polygons with individual angular constraints