100 search results - page 8 / 20 » Planar Visibility Counting |
104
click to vote
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
VIS
2003
IEEE
15 years 11 months ago
2003
IEEE
Traditional volume visualization techniques may provide incomplete clinical information needed for many applications in medical visualization. Especially in the area of vascular v...
74
Voted
COMPGEOM
2008
ACM
14 years 12 months ago
2008
ACM
When an observer is in a 3D scene, a topological change in the view arises when the line of sight is tangent to four objects. If we consider polyhedral scenes, the relevant lines ...
GD
1997
Springer
15 years 2 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...