Generation of convex polygons with individual angular constraints

DOI10.1016/0020-0190(87)90179-7MaRDI QIDQ1107995zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3770441 (Why is no real title available?)
• Programming as a Discipline of Mathematical Nature

Cited in

(1)

• An optimal algorithm for realizing a Delaunay triangulation

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

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