We present a new algorithm for finding minimum-link rectilinear paths among rectilinear obstacles in the plane. Given a triangulated rectilinear domain of h pairwise-disjoint rectilinear obstacles with a total of n vertices, our algorithm can find a minimum-link rectilinear path between any two points in O(n+hlogh) time. Further, within the same time our algorithm can build an O(n)-size data structure for any source point s, such that given any query point t, the number of edges of a minimum-link rectilinear path from s to t can be computed in O(logn) time and the actual path can be output in additional time linear in the number of the edges of the path. The previously best algorithms for the problems run in O(nlogn) time.