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

DOI10.1109/T-C.1975.224276zbMath0302.68105MaRDI QIDQ4057650

Hou-Yuan F. Feng, Theodosios Pavlidis

Publication date: 1975

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (10)

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

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