Recursive voids for identifying a nonconvex boundary of a set of points in the plane

DOI10.1016/J.PATCOG.2013.05.013zbMATH Open1326.68314OpenAlexW2007981896MaRDI QIDQ898221FDOQ898221

Christopher W. Zobel, Onur Şeref

Publication date: 8 December 2015

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

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

Recommendations

• Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
• scientific article; zbMATH DE number 3854464
• Boundary of a non-uniform point cloud for reconstruction, extended abstract
• Shape of an arbitrary finite point set in \(\mathbb{R}^2\)
• scientific article; zbMATH DE number 2013287

zbMATH Keywords

computational geometrylinear time complexitylowest common ancestornonconvex boundaryoutput sensitivity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The quickhull algorithm for convex hulls
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Fast Algorithms for Finding Nearest Common Ancestors
• On the identification of the convex hull of a finite set of points in the plane
• On the shape 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
• Title not available (Why is that?)
• Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)

Cited In (1)

• Finding the composite outer boundary and holes of a set of closed curves

Uses Software

• Qhull

This page was built for publication: Recursive voids for identifying a nonconvex boundary of a set of points in the plane

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