38 search results - page 3 / 8 » Connectivity check in 3-connected planar graphs with obstacl... |
FCT
2009
Springer
14 years 3 months ago
2009
Springer
DM
2006
13 years 9 months ago
2006
GD
2004
Springer
14 years 2 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
TCS
2008
13 years 9 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...