Sciweavers

32 search results - page 4 / 7
» gd 2006
Sort
View
GD
2005
Springer
15 years 3 months ago
Drawing Kn in Three Dimensions with One Bend Per Edge
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
Olivier Devillers, Hazel Everett, Sylvain Lazard, ...
GD
2006
Springer
15 years 1 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
GD
2006
Springer
15 years 1 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
GD
2006
Springer
15 years 1 months ago
Controllable and Progressive Edge Clustering for Large Networks
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
Huamin Qu, Hong Zhou, Yingcai Wu
EUROCRYPT
2006
Springer
15 years 1 months ago
Security Analysis of the Strong Diffie-Hellman Problem
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
Jung Hee Cheon