Fast computation of the modality of polygons

DOI10.1016/0196-6774(86)90028-3zbMath0623.52002OpenAlexW2029929139MaRDI QIDQ3761211

Alok Aggarwal, Robert Melville

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90028-3

zbMATH Keywords

algorithmscomputational geometrymodality of polygons

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Related Items (7)

Geometric applications of a matrix-searching algorithm ⋮ On the unimodality of convex polygons ⋮ Constructing bimodal convex hexagons ⋮ A simple linear-time algorithm for computing the ring and MST of unimodal polygons ⋮ Complexity, convexity, and unimodality ⋮ The morphology of convex polygons ⋮ On the modality of convex polygons

This page was built for publication: Fast computation of the modality of polygons