Measuring Concavity on a Rectangular Mosaic
From MaRDI portal
Publication:5660522
DOI10.1109/T-C.1972.223507zbMath0247.68046MaRDI QIDQ5660522
Publication date: 1972
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (26)
A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ On piecewise linear approximation of planar Jordan curves ⋮ Finding the convex hull of a simple polygon in linear time ⋮ Partitioning and separating sets of orthogonal polygons ⋮ The orthogonal convex skull problem ⋮ Measuring 2-D shape compactness using the contact perimeter ⋮ A linear algorithm for finding the convex hull of a simple polygon ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ Digital and cellular convexity ⋮ A new algorithm for computing the convex hull of a planar point set ⋮ A new triangulation-linear class of simple polygons ⋮ Fuzzy clustering using the convex hull as geometrical model ⋮ An Elementary Algorithm for Digital Arc Segmentation ⋮ On finding the convex hull of a simple polygon ⋮ Digital geometry ⋮ Approximate convex decomposition of polygons ⋮ Convex hull of a finite set of points in two dimensions ⋮ Approximate convex decomposition of polyhedra and its applications ⋮ Applications of a two-dimensional hidden-line algorithm to other geometric problems ⋮ The symmetric all-furthest-neighbor problem ⋮ A linear time algorithm for computing the convex hull of an ordered crossing polygon ⋮ On the conditions for success of Sklansky's convex hull algorithm ⋮ A linear time algorithm for obtaining the convex hull of a simple polygon ⋮ On the X-Y convex hull of a set of X-Y polygons ⋮ A convex hull algorithm for planar simple polygons ⋮ Some performance tests of convex hull algorithms
This page was built for publication: Measuring Concavity on a Rectangular Mosaic
