A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane

2012/06/20 by Arindam Biswas, Partha Bhowmick, Moumita Sarkar +1 · 2 citations
Computer Science · Mathematics · #Algorithm #Artificial intelligence #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Computer science #Convex hull #Digital Image Processing Techniques #Geometry #Grid #Hull #Mathematics #Object (grammar) #Regular polygon #Time complexity

paper · doi:10.1016/j.ins.2012.05.029

openalex publication_date 2012/06/20 · crossref created 2012/06/20 · crossref issued 2012/12/01 · crossref published 2012/12/01 · crossref published-print 2012/12/01 · crossref deposited 2019/06/30 · openalex created_date 2025/10/10 · crossref indexed 2026/02/10 · openalex updated_date 2026/06/11

Citations

• On the definition and computation of rectilinear convex hulls
• Fundamentals of Restricted-Orientation Convexity
• Scanline algorithms on a grid
• The quickhull algorithm for convex hulls

Cited by

• Efficient Retrieval of Logos Using Rough Set Reducts
• Orthogonal convex hull [wikipedia]