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

DOI10.1016/0898-1221(85)90059-8zbMath0573.51016MaRDI 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 polygon; symmetric furthest neighbour vertices

Mathematics Subject Classification ID

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

51M20: Polyhedra and polytopes; regular figures, division of spaces

51M05: Euclidean geometries (general) and generalizations