Before revision:  Our main result is an O(n^2) time algorithm , where n denotes the number of edges of the given polygon.
After revision:  By proving and utilizing several structural properties of the LMAPs, we compute all of them (including all the MAPs) in O(n^2) time algorithm , where n denotes the number of edges of the given polygon.