Sciweavers

725 search results - page 6 / 145
» Graph Drawing in Motion
Sort
View
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 28 days ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
GD
2000
Springer
13 years 11 months ago
GRIP: Graph dRawing with Intelligent Placement
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
Pawel Gajer, Stephen G. Kobourov
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
ICPR
2008
IEEE
14 years 2 months ago
Resolution enhancement for binocular stereo
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...
Arnav V. Bhavsar, A. N. Rajagopalan
GD
2003
Springer
14 years 23 days ago
Three-Dimensional Grid Drawings with Sub-quadratic Volume
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
Vida Dujmovic, David R. Wood