Generation of convex polygons with individual angular constraints

DOI10.1016/0020-0190(87)90179-7zbMATH Open0653.68027OpenAlexW2070682356MaRDI QIDQ1107995FDOQ1107995

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

• Title not available (Why is that?)
• Programming as a Discipline of Mathematical Nature
• Title not available (Why is that?)
• Title not available (Why is that?)

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)