Results 221 to 230 of about 161,455 (261)
Some of the next articles are maybe not open access.

Dynamic Map Labeling

IEEE Transactions on Visualization and Computer Graphics, 2006
We address the problem of filtering, selecting and placing labels on a dynamic map, which is characterized by continuous zooming and panning capabilities. This consists of two interrelated issues. The first is to avoid label popping and other artifacts that cause confusion and interrupt navigation, and the second is to label at interactive speed.
Chee Yap
exaly   +3 more sources

User Hints for map labeling

Journal of Visual Languages and Computing, 2008
Cartography is one of the oldest forms of visualization. It has applications not only in geography but in many other science fields. A significant visual problem in cartography is the map-labeling problem, which consists of assigning positions for the labels of graphical features of a map so that these elements can be uniquely identified. Although much
Hugo A D do Nascimento, Peter Eades
exaly   +3 more sources

LABELING A RECTILINEAR MAP WITH SLIDING LABELS

International Journal of Computational Geometry & Applications, 2001
A rectilinear map consists of a set of mutually non-intersecting rectilinear (i.e., horizontal or vertical) line segments, and each segment is allowed to use a rectangular label of height B and length the same as the segment. Sliding labels are not restricted to any finite number of predefined positions but can slide and be placed at any position as ...
Sung Kwon Kim   +2 more
openaire   +2 more sources

Canonical Labeling of Proteome Maps

Journal of Proteome Research, 2005
We propose a canonical labeling of proteome maps, which enables one to sort and catalog the maps in a simple way. The canonical label of a proteome map is based on the canonical labeling of vertexes of Hasse diagram embedded in the map resulting in the adjacency matrix, the rows of which when viewed as binary numbers are the smallest possible such ...
Randić, Milan   +5 more
openaire   +3 more sources

New Approximation Algorithms for Map Labeling with Sliding Labels

Journal of Combinatorial Optimization, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Binhai Zhu, Zhongping Qin
openaire   +1 more source

Elastic Labels Around the Perimeter of a Map

Journal of Algorithms, 1999
Summary: We study the map labeling problem of attaching rectangular labels to points, but with the novelty that our labels are elastic, in the sense that the height and width of each rectangle may vary though we require a fixed area. Our main result is a polynomial time algorithm for the rectangle perimeter labeling problem, where the points to be ...
Claudia Iturriaga, Anna Lubiw
openaire   +1 more source

Labeling streets in interactive maps using embedded labels

Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014
We consider the problem of labeling linear objects (such as streets) in interactive maps where the user can pan, zoom, and rotate continuously. Our labels contain text (such as street names). They are embedded into the objects they label, i.e., they follow the curvature of the objects, they do not move with respect to the map background, but they scale
Nadine Schwartges   +2 more
openaire   +1 more source

Point Labeling with Sliding Labels in Interactive Maps

2014
We consider the problem of labeling point objects in interactive maps where the user can pan and zoom continuously. We allow labels to slide along the point they label. We assume that each point comes with a priority; the higher the priority the more important it is to label the point.
Nadine Schwartges   +3 more
openaire   +1 more source

Combining Traditional Map Labeling with Boundary Labeling

2011
The traditional map labeling problems are mostly NP-hard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their ...
Michael A. Bekos   +3 more
openaire   +1 more source

New Bounds on Map Labeling with Circular Labels

2004
We present new approximation algorithms for the NP-hard problems of labeling points with maximum-size uniform circles and circle pairs (MLUC and MLUCP) Our algorithms build on the important concept of maximal feasible region and new algorithmic techniques We obtain several results: a (2.98 + e)-approximation for MLUC, improving previous factor 3.0 + e;
Minghui Jiang 0001   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy