Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ALGORITHMICA
2002

favoriteEmaildiscussreport

89views more ALGORITHMICA 2002»

Embedding Linkages on an Integer Lattice

13 years 4 months ago

Embedding Linkages on an Integer Lattice

Download www.cs.umass.edu

This paper answers the following question: Given an \erector set" linkage, a connected set of xed-length links, what is the minimal needed to adjust the edge lengths so that the vertices of the linkage can be placed on integer lattice points? Each edge length is allowed to change by at most . Angles are not xed, but collinearity must be

Susan Landau, Neil Immerman

Real-time Traffic

ALGORITHMICA 2002 | Connected Set | Edge | Xed-length Links |

claim paper

Related Content

» SubexponentialTime Framework for Optimal Embeddings of Graphs in Integer Lattices

» Algorithms for Drawing Media

» Weak sense of direction labelings and graph embeddings

» Memory optimization by counting points in integer transformations of parametric polytopes

» The lattice dimension of a graph

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	ALGORITHMICA
Authors	Susan Landau, Neil Immerman

Comments (0)