Cartographic generalization using primitives and constraints", claus.berner,monika.sester}@ikg.uni-hannover.de

We propose the use of primitives, containers, and constraints as a computational means for cartographic generalization. Primitives bundle object geometry and internal constraints, as well as a discrete behaviour. Containers are collections of primitives which also exhibit a certain behaviour, such as arranging their children in a linear way or as a regular pattern of rows and columns. Together, they form a hierarchy of containers and primitives which is used to lay out a map. This layout is ultimately determined by putting together all constraint equations, and finding an overall solution which minimizes certain criteria while enforcing strict constraints at the same time. We explore the handling and solution of constraint equation systems by looking into constraint graphs, Gröbner bases, and row reduction of Jacobi matrices