Sciweavers

136 search results - page 19 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
CVPR
2008
IEEE
13 years 9 months ago
Probabilistic multi-tensor estimation using the Tensor Distribution Function
Diffusion weighted magnetic resonance (MR) imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water m...
Alex D. Leow, Siwei Zhu, Katie McMahon, Greig I. d...
COMPGEOM
1995
ACM
13 years 11 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
JGT
2006
101views more  JGT 2006»
13 years 7 months ago
Distinguishing geometric graphs
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
Michael O. Albertson, Debra L. Boutin
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
13 years 6 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....