Triangulating a simple polygon in linear time
Discrete & Computational Geometry
A linear algorithm for bisecting a polygon
Information Processing Letters
The area bisectors of a polygon and force equilibria in programmable vector fields
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Spatial information retrieval and geographical ontologies an overview of the SPIRIT project
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Computing the Center of Area of a Polygon
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
How Spoken Language and Signed Language Structure Space Differently
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
GeoVSM: An Integrated Retrieval Model for Geographic Information
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Multi-agent Systems for Web-Based Map Information Retrieval
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
| Hi-index | 0.00 |
Motivated by geographic information retrieval, we study the problem of partitioning a simple polygon into four parts that can be considered as the North, East, West, and South. We list criteria for such partitionings, propose formalizations into geometric problems, and give efficient algorithms. An implementation and tests on country outlines show the results for three different partitionings.