Fast computation of the modality of polygons

DOI10.1016/0196-6774(86)90028-3MaRDI QIDQ3761211zbMATH OpenOpenAlexFDO

Authors Alok Aggarwal, Robert Melville

Publication date 1986

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 701117
• A fast algorithm for polygon operations
• Fast triangulation of the plane with respect to simple polygons
• EFFICIENT APPROXIMATION OF CONVEX POLYGONS
• Fast detection of polyhedral intersection
• scientific article; zbMATH DE number 3911704
• scientific article; zbMATH DE number 1507298

Cited in

(15)

• Geometric applications of a matrix-searching algorithm
• On the unimodality of convex polygons
• A simple linear-time algorithm for computing the ring and MST of unimodal polygons
• The morphology of convex polygons
• Model-based probing strategies for convex polygons
• Algorithmen zur Unimodalitätsbestimmung einfacher Polygone. (Algorithms for determination of unimodality of simple polygons)
• Moldable and castable polygons
• Probing polygons minimally is hard
• Complexity, convexity, and unimodality
• Constructing bimodal convex hexagons
• scientific article; zbMATH DE number 98471 (Why is no real title available?)
• A unimodal counterexample to a diameter algorithm
• scientific article; zbMATH DE number 701117 (Why is no real title available?)
• Fast polyhedra abstract domain
• On the modality of convex polygons

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

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