scientific article; zbMATH DE number 98536

MaRDI QIDQ4022672zbMATH OpenFDO

Authors D. Acketa, Matić-Kekić, Joviša Žunić

Publication date 17 January 1993

zbMATH Keywords

algorithmFarey sequencesmall diametersdigital convex \(n\)-gons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Other problems of combinatorial convexity (52A37)

Recommendations

• Non-greedy optimal digital convex polygons
• An exact construction of digital convex polygons with minimal diameter
• scientific article; zbMATH DE number 563347
• scientific article; zbMATH DE number 1200214
• scientific article; zbMATH DE number 988752
• scientific article; zbMATH DE number 1241785
• An optimal algorithm for polygonal approximation of digitized curves
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Efficiently testing digital convexity and recognizing digital convex polygons
• An algorithm for the construction of convex hulls in simple integer recourse programming

Cited in

(8)

• A unimodal counterexample to a diameter algorithm
• Efficient Algorithms to Test Digital Convexity
• Efficiently testing digital convexity and recognizing digital convex polygons
• scientific article; zbMATH DE number 988752 (Why is no real title available?)
• scientific article; zbMATH DE number 792646 (Why is no real title available?)
• scientific article; zbMATH DE number 736283 (Why is no real title available?)
• scientific article; zbMATH DE number 1200214 (Why is no real title available?)
• The minimal size of a square which includes a digital convex 2K–gon

This page was built for publication:

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