An algorithm for locating candidate labelling boxes within a polygon
Links
- More information: Publisher Index Page (html)
- 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 labelling 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 | Conference Paper |
|---|---|
| Publication Subtype | Conference Paper |
| Title | An algorithm for locating candidate labelling boxes within a polygon |
| Year Published | 1987 |
| Language | English |
| Publisher | Cartography and Geographic Information Society |
| Contributing office(s) | Earth Resources Observation and Science (EROS) Center |
| Description | 12 p. |
| Larger Work Type | Book |
| Larger Work Subtype | Conference publication |
| Larger Work Title | Auto-Carto VIII: Proceedings of the international symposium on computer-assisted cartography |
| First page | 689 |
| Last page | 700 |
| Conference Title | Auto-Carto VIII: International Symposium on Computer-Assisted Cartography |
| Conference Location | Baltimore, MD |
| Conference Date | Mar 29- Apr 3, 1987 |
| Google Analytic Metrics | Metrics page |