Efficient generation of simple polygons for characterizing the shape of a set of points in the plane

DOI10.1016/j.patcog.2008.03.023zbMath1147.68780OpenAlexW2164799852WikidataQ57940112 ScholiaQ57940112MaRDI QIDQ936454

Lars Kulik, Antony Galton, Matt Duckham, Michael Worboys

Publication date: 13 August 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.03.023

zbMATH Keywords

cartographyconvex hullGISshape analysisalpha shape

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Novel concave hull-based heuristic algorithm for TSP ⋮ A geo-clustering approach for the detection of areas-of-interest and their underlying semantics ⋮ \(\alpha\)-concave hull, a generalization of convex hull ⋮ An input-independent single pass algorithm for reconstruction from dot patterns and boundary samples ⋮ Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Recursive voids for identifying a nonconvex boundary of a set of points in the plane ⋮ Preserving geometric properties in reconstructing regions from internal and nearby points ⋮ A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\)

Uses Software

• Powercrust

Cites Work

• Triangulating a simple polygon in linear time
• \(r\)-regular shape reconstruction from unorganized points
• Functional specification and prototyping with oriented combinatorial maps
• On the shape of a set of points in the plane
• On the convex layers of a planar set
• Computational Geometry in C
• The power crust, unions of balls, and the medial axis transform