725 search results - page 45 / 145 » Graph Drawing in Motion |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
SMA
2008
ACM
13 years 8 months ago
2008
ACM
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
DIAGRAMS
2006
Springer
13 years 12 months ago
2006
Springer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
COMGEO
2011
ACM
13 years 5 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
WSC
1997
13 years 11 months ago
1997
Proof Animation™ 4.0 is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, mi...