G.W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In D-Z. Du, P. Eades, and X. Lin, editors, Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON'2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....nature and optimality cannot be guaranteed. Exact approaches include rule based systems as proposed by Doerschler and Freeman [6] Cromley [5] and Zoraster [19] transform the PFLP into a 0 1 integer programming problem and solve it with branch and cut techniques. Recently, Klau and Mutzel [13] presented another 0 1 integer programming based branch and cut approach for the related label number maximization problem, in which the number of labels that can be placed without overlap is maximized. On the side of heuristic approaches, a simple greedy heuristic [18] and a discrete gradient ....

G. W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Proceedings of the 6th Annual International Computing and Combinatorics Conference, volume 1858 of LNCS, pages 340--350. Springer, 2000.

....in which each point is labelled with one (square) region from a finite set of candidate (square) regions. Kakoulis and Tollis [22] exploit this to unify several slightly more general map labelling problems. A di#erent approach reported on by van Kreveld, Strijk, and Wol# [25] and Klau and Mutzel [24] is to allow a label to take any position, as long as its corresponding point is on its boundary. This leads to so called sliding map labelling models. The advantage of a sliding model is that more labels can be placed without overlap. In more recent studies also other shapes of the label regions ....

G.W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In D-Z. Du, P. Eades, and X. Lin, editors, Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON'2000), Lecture Notes in Computer Science, 2000. To appear.

....Number of vertices Improvement in Fig. 9. Quality of opt compared to orig 14 Gunnar W. Klau and Petra Mutzel interesting in its own right and has direct applications, e.g. in cartography, geographical information systems and graphical interfaces. A detailed description of our approach is [14]. Many papers have been published on the label number maximisation problem (for an overview, see the bibliography [21] So far, most previous work on map labelling has concentrated on the discrete model, which allows only a nite number of positions per label. The most popular discrete model is ....

G. W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In Proc. 6th Annual International Computing and Combinatorics Conference (COCOON 2000), LNCS, Sydney, Australia, 2000. Springer{Verlag. To appear.

No context found.

G.W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In D-Z. Du, P. Eades, and X. Lin, editors, Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON'2000.

No context found.

Gunnar W. Klau and Petra Mutzel. Optimal labelling of point features in the slider model. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Proc. Sixth Annual International Computing and Combinatorics Conference (COCOON'00), volume 1858 of Lecture Notes in Computer Science, pages 340-350, Sydney, 26-28 July 2000. SpringerVerlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC