1949 search results - page 107 / 390 » Random graphs on surfaces |
155
click to vote
MVA
2008
15 years 4 months ago
2008
Abstract We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components an...
110
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
118
click to vote
ENDM
2008
15 years 4 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
131
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
164
click to vote
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...