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

DOI10.1016/J.PATCOG.2013.05.013zbMath1326.68314OpenAlexW2007981896MaRDI QIDQ898221

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

zbMATH Keywords

computational geometrylinear time complexitylowest common ancestornonconvex boundaryoutput sensitivity

Mathematics Subject Classification ID

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

Uses Software

• Qhull

Cites Work

• Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
• Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• On the identification of the convex hull of a finite set of points in the plane
• Fast Algorithms for Finding Nearest Common Ancestors
• On the shape of a set of points in the plane
• The quickhull algorithm for convex hulls
• Unnamed Item

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