Measuring Concavity on a Rectangular Mosaic

Cited in

(28)

A new algorithm for computing the convex hull of a planar point set
A linear time algorithm for computing the convex hull of an ordered crossing polygon
On the X-Y convex hull of a set of X-Y polygons
Finding the convex hull of a simple polygon in linear time
The orthogonal convex skull problem
Approximate convex decomposition of polygons
Applications of a two-dimensional hidden-line algorithm to other geometric problems
A polygonal approximation for general 4-contours corresponding to weakly simple curves
Fuzzy clustering using the convex hull as geometrical model
Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
On finding the convex hull of a simple polygon
On piecewise linear approximation of planar Jordan curves
Approximate convex decomposition of polyhedra and its applications
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
Partitioning and separating sets of orthogonal polygons
Digital and cellular convexity
Digital geometry
A convex hull algorithm for planar simple polygons
Measuring 2-D shape compactness using the contact perimeter
Convex hull of a finite set of points in two dimensions
A new triangulation-linear class of simple polygons
On the conditions for success of Sklansky's convex hull algorithm
Some performance tests of convex hull algorithms
The symmetric all-furthest-neighbor problem
A linear time algorithm for obtaining the convex hull of a simple polygon
An elementary algorithm for digital arc segmentation
Convex-hull algorithms: implementation, testing, and experimentation
A linear algorithm for finding the convex hull of a simple polygon

This page was built for publication: Measuring Concavity on a Rectangular Mosaic

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