Sciweavers

1633 search results - page 174 / 327
» Planar Map Graphs
Sort
View
COMBINATORICA
2011
12 years 10 months ago
A local criterion for Tverberg graphs
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...
Alexander Engström
CVPR
1999
IEEE
15 years 24 days ago
On the Intrinsic Reconstruction of Shape from its Symmetries
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...
Peter J. Giblin, Benjamin B. Kimia
LATIN
2010
Springer
14 years 5 months ago
Some Observations on Holographic Algorithms
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...
Leslie G. Valiant
ICALP
2007
Springer
14 years 5 months ago
Size Competitive Meshing Without Large Angles
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...
Gary L. Miller, Todd Phillips, Donald Sheehy
SENSYS
2004
ACM
14 years 4 months ago
Practical and robust geographic routing in wireless networks
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...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...