Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

DOI10.1109/T-C.1975.224276MaRDI QIDQ4057650zbMATH OpenFDO

Authors Hou-Yuan F. Feng, Theodosios Pavlidis

Publication date 1975

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1975.224276

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(11)

• Decomposition and intersection of simple splinegons
• On decomposing polygons into uniformly monotone parts
• Detecting the intersection of convex objects in the plane
• The Fibonacci search for cornerpoint detection of two-dimensional images
• Algorithms for the decomposition of a polygon into convex polygons
• Approximation algorithms for decomposing octilinear polygons
• Approximate convex decomposition of polygons
• Minimum star partitions of simple polygons in polynomial time
• Minimum k-partitioning of rectilinear polygons
• Triangulating a nonconvex polytope
• Approximation algorithms for art gallery problems in polygons

This page was built for publication: Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

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