90 search results - page 15 / 18 » Obfuscated Drawings of Planar Graphs |
DAM
2011
13 years 4 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
DCG
2008
13 years 10 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
COMPGEOM
2003
ACM
14 years 3 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
GD
2006
Springer
14 years 1 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...