Show simple item record

dc.contributor.authorKaiser, Mark J.
dc.identifier.citationM.J. Kaiser, The n-point and six-partite point of a convex polygon, Mathematical and Computer Modelling, Volume 32, Issues 7-8, 2000, Pages 813-823, ISSN 0895-7177,
dc.descriptionClick on the DOI link below to access the article (may not be free).
dc.description.abstractThe n-point of a planar convex polygon is defined through a geometric optimization problem associated with a 'balance' functional and wedge set. The balance functional provides a measure of the imbalance of the polygon induced through the wedge set and the n-point is defined as the point which minimizes the balance functional. The classical six-partite point is the point where three lines pass through and subdivide the polygon into six equal area subsets. The n-point and six-partite point are solved through enumerative search strategies and examples are used throughout to illustrate the solution techniques. (C) 2000 Elsevier Science Ltd.
dc.publisherPergamon Press
dc.relation.ispartofseriesMathematical and Computer Modelling
dc.relation.ispartofseriesv 32, no. 7
dc.subjectBalance functional
dc.subjectConstructive convex geometry
dc.subjectGeometric optimization
dc.titleThe n-point and six-partite point of a convex polygon
dc.rights.holderCopyright 2000 Elsevier Science Ltd. All rights reserved.

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

  • ISME Research Publications
    Research works published by faculty and students of the Department of Industrial, Systems, and Manufacturing Engineering

Show simple item record