An algorithm for locating candidate labeling boxes within a polygon
Links
- More information: Publisher Index Page (via DOI)
- Download citation as: RIS | Dublin Core
Abstract
Vector-based geographic information systems usually require annotation, such as a polygon number or attribute data, in a suitable location within a polygon. Traditional methods usually compute the polygon centroid, test the centroid for inclusion or exclusion, and select some alternative point when the centroid falls outside the polygon. Two problems are associated with this approach: (1) the text can be centered on the point, but may be placed in a visually awkward place, and (2) part of the text may fall outside the polygon and may overlap other polygon boundaries or other text labels. An algorithm is presented that circumvents both of these problems, by computing a number of horizontal candidate labeling rectangles (boxes) within a polygon from which a suitable selection can be made or from which one may conclude that the text label does not fit the polygon.
| Publication type | Article |
|---|---|
| Publication Subtype | Journal Article |
| Title | An algorithm for locating candidate labeling boxes within a polygon |
| Series title | American Cartographer |
| DOI | 10.1559/152304089783814034 |
| Volume | 16 |
| Issue | 3 |
| Year Published | 1989 |
| Language | English |
| Publisher | Taylor & Francis |
| Contributing office(s) | Earth Resources Observation and Science (EROS) Center |
| Description | 9 p. |
| First page | 201 |
| Last page | 209 |
| Online Only (Y/N) | N |
| Additional Online Files (Y/N) | N |
| Google Analytic Metrics | Metrics page |