  We are interested in embedding trees T with maximum degree at most four in a
rectangular grid, such that the vertices of T correspond to grid points, while
edges of T correspond to non-intersecting straight segments of the grid lines.
Such embeddings are called straight models. While each edge is represented by a
straight segment, a path of T is represented in the model by the union of the
segments corresponding to its edges, which may consist of a path in the model
having several bends. The aim is to determine a straight model of a given tree
T minimizing the maximum number of bends over all paths of T. We provide a
quadratic-time algorithm for this problem. We also show how to construct
straight models that have k as its minimum number of bends and with the least
number of vertices possible. As an application of our algorithm, we provide an
upper bound on the number of bends of EPG models of graphs that are both VPT
and EPT.
