scientific article; zbMATH DE number 437533

MaRDI QIDQ3140405zbMATH OpenFDO

Authors John D. Hobby

Publication date 2 January 1994

zbMATH Keywords

data structuredigital imageinteger arithmeticpolygonal approximationset of closed curvesshape

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Polygonal approximation by the minimax method
• scientific article; zbMATH DE number 3228720
• scientific article; zbMATH DE number 177850
• Publication:4727326
• Approximation for minimum triangulation of convex polyhedra
• Approximating Polygonal Curves in Two and Three Dimensions
• scientific article; zbMATH DE number 2080989
• scientific article; zbMATH DE number 3105840

Cited in

(10)

• Computing melodic templates in oral music traditions
• Dynamic minimum length polygon
• Polygonal approximation by the minimax method
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• scientific article; zbMATH DE number 1946619 (Why is no real title available?)
• scientific article; zbMATH DE number 2080989 (Why is no real title available?)
• Recovering a Polygon from Noisy Data
• Flip procedure in geometric approximation of multiple-component shapes -- application to multiple-inclusion detection
• scientific article; zbMATH DE number 3228720 (Why is no real title available?)
• Two linear-time algorithms for computing the minimum length polygon of a digital contour

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