Procedural elements for computer graphics
Procedural elements for computer graphics
IEEE Computer Graphics and Applications
Programming in Prolog
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
A polynomial time solution for labeling a rectilinear map
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Efficient Approximation Algorithms for Multi-label Map Labeling
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Polynomial Time Algorithms for Three-Label Point Labeling
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Polynomial time algorithms for three-label point labeling
Theoretical Computer Science - Computing and combinatorics
Journal of Visual Languages and Computing
A chorem-based approach for visually synthesizing complex phenomena
Information Visualization
Potentialities of chorems as visual summaries of geographic databases contents
VISUAL'07 Proceedings of the 9th international conference on Advances in visual information systems
Automatic annotation placement for interactive maps
Proceedings of the 2013 ACM international conference on Interactive tabletops and surfaces
| Hi-index | 0.00 |
A major problem in computer cartography is how to place names on maps so they are clearly associated with the features they annotate, while avoiding overlap with other names and features. The logic programming language, Prolog, can be used to express the name-placement problem as a set of rules, referring primarily to the identification of free space, the generation of trial label positions, and the resolution of conflict between these positions. Cartographic features can be specified either explicitly as facts in the Prolog database or implicitly by presenting Prolog with the results of a prior analysis of potential label positions. The Prolog inference mechanism can then determine whether there is a combination of label positions that satisfies the rules of placement.