1633 search results - page 174 / 327 » Planar Map Graphs |
148
Voted
COMBINATORICA
2011
14 years 14 days ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
94
Voted
CVPR
1999
IEEE
16 years 2 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
97
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
101
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
SENSYS
2004
ACM
15 years 6 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...