The n-point and six-partite point of a convex polygon
Kaiser, Mark J.
Kaiser, Mark J.
Citations
Altmetric:
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2000-08-1
Type
Article
Genre
Keywords
Balance functional,Constructive convex geometry,Geometric optimization
Subjects (LCSH)
Citation
M.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, https://doi.org/10.1016/S0895-7177(00)00173-4.
Abstract
The 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.
Table of Contents
Description
Click on the DOI link below to access the article (may not be free).
Publisher
Pergamon Press
Journal
Book Title
Series
Mathematical and Computer Modelling
v 32, no. 7
v 32, no. 7
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
0895-7177