A new linear convex hull algorithm for simple polygons (Corresp.)

DOI10.1109/TIT.1984.1056845zbMath0531.68023OpenAlexW2151355291MaRDI QIDQ3313273

Binay K. Bhattacharya, Hossam ElGindy

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056845

zbMATH Keywords

simple polygonsunimodalitylinear convex hull algorithmSklansky's scan

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items (8)

Staircase visibility and computation of kernels ⋮ Finding a closet visible vertex pair between two polygons ⋮ On-line construction of the convex hull of a simple polyline ⋮ Three problems about simple polygons ⋮ COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION ⋮ Optimal computation of finitely oriented convex hulls ⋮ Numerical stability of a convex hull algorithm for simple polygons ⋮ Convex hulls of objects bounded by algebraic curves

This page was built for publication: A new linear convex hull algorithm for simple polygons (Corresp.)