On the multimodality of distances in convex polygons

DOI10.1016/0898-1221(82)90054-2zbMath0487.68062OpenAlexW2036223514MaRDI QIDQ1165585

Binay K. Bhattacharya, Godfried T. Toussaint, David Avis

Publication date: 1982

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(82)90054-2

zbMATH Keywords

diameteralgorithm of Dobkin and Snydermulti-modal functionvertex convex polygons

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items

On determining the on-line minimax linear fit to a discrete point set in the plane, Geometric applications of a matrix-searching algorithm, Fast algorithms for computing the diameter of a finite planar set, 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, Algorithms for \(k\)-dispersion for points in convex position in the plane, The morphology of convex polygons, On the modality of convex polygons, Maximum-area triangle in a convex polygon, revisited, Finding the minimum vertex distance between two disjoint convex polygons in linear time

Cites Work

• The symmetric all-furthest-neighbor problem
• A Counterexample to a Diameter Algorithm for Convex Polygons
• Unnamed Item
• Unnamed Item