On the multimodality of distances in convex polygons

DOI10.1016/0898-1221(82)90054-2MaRDI QIDQ1165585zbMATH OpenOpenAlexFDO

Authors David Avis, Godfried Toussaint, Binay Bhattacharya

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

algorithm of Dobkin and Snyderdiametermulti-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)

Cites work

• A Counterexample to a Diameter Algorithm for Convex Polygons
• scientific article; zbMATH DE number 3945378 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• The symmetric all-furthest-neighbor problem

Cited in

(13)

• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• 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
• A simple linear-time algorithm for computing the ring and MST of unimodal polygons
• The morphology of convex polygons
• Complexity, convexity, and unimodality
• Constructing bimodal convex hexagons
• Algorithms for \(k\)-dispersion for points in convex position in the plane
• Algorithms for k-dispersion for points in convex position in the plane
• On the modality of convex polygons
• Maximum-area triangle in a convex polygon, revisited

This page was built for publication: On the multimodality of distances in convex polygons

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