1348 search results - page 12 / 270 » Matching planar maps |
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
COMBINATORICS
2004
13 years 7 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
ICALP
2003
Springer
14 years 21 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
GIS
2003
ACM
14 years 21 days ago
2003
ACM
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...