scientific article; zbMATH DE number 3854464

MaRDI QIDQ3323309zbMATH OpenFDO

Authors Raimund Seidel, Herbert Edelsbrunner, David Kirkpatrick

Publication date 1982

zbMATH Keywords

analysis of patternsconcrete complexityconvex hullDelaunay triangulationsEuclidean planefinite point-setgeometric algorithmshape

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Recommendations

• Three-dimensional alpha shapes
• On shape Delaunay tessellations
• Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
• Order-k -hulls and -shapes
• Delaunay triangulation and the convex hull of n points in expected linear time

Cited in

(22)

• Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
• On shape Delaunay tessellations
• Parallel computation of alpha complexes for biomolecules
• Shape of an arbitrary finite point set in \(\mathbb{R}^2\)
• On estimating the perimeter using the alpha-shape
• Salient and reentrant points of discrete sets
• Elliptic diagrams: Application to patterns detection from a finite set of points
• Delaunay triangulations approximate anchor hulls
• Selection of \(\alpha \) for \(\alpha \)-hull and formulation of fuzzy \(\alpha \)-hull in \(\mathbb{R}^{2}\)
• scientific article; zbMATH DE number 1800031 (Why is no real title available?)
• Nearly convex sets and the shape of legislative districts
• Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms
• Outline of a set of points
• Three-dimensional alpha shapes
• Proximal planar shapes. Correspondence between triangulated shapes and nerve complexes
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Weighted \({\mathcal A}\)-shape: A descriptor of the shape of a point set
• Interactive exploration of the temporal \(\alpha\)-shape
• Finite nondense point set analysis
• Delaunay triangulations approximate anchor hulls
• Recursive voids for identifying a nonconvex boundary of a set of points in the plane
• Efficient generation of simple polygons for characterizing the shape of a set of points in the plane

This page was built for publication:

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