On the determination of all pairs of symmetric furthest neighbor vertices of a simple polygon

DOI10.1016/0898-1221(85)90059-8zbMath0573.51016OpenAlexW2008181882WikidataQ127878095 ScholiaQ127878095MaRDI QIDQ1063241

B. George

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90059-8

zbMATH Keywords

simple closed polygonsymmetric furthest neighbour vertices

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Polyhedra and polytopes; regular figures, division of spaces (51M20) Euclidean geometries (general) and generalizations (51M05)

Cites Work

• The symmetric all-furthest-neighbor problem

This page was built for publication: On the determination of all pairs of symmetric furthest neighbor vertices of a simple polygon