1115 search results - page 48 / 223 » Separating Shape Graphs |
PG
2000
IEEE
14 years 26 days ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
3DPVT
2004
IEEE
14 years 7 days ago
2004
IEEE
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...
WG
1999
Springer
14 years 22 days ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
COMBINATORICS
2006
13 years 8 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...