We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an {\em orderly pair} for any connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an orderly spanning tree of $H$. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem, (2) the first area-optimal 2-visibility drawing of $G$, and (3) the best known encodings of $G$ with O(1)-time query support. All algorithms in this paper run in linear time.Comment: 25 pages, 7 figures, A preliminary version appeared in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington D.C., USA, January 7-9, 2001, pp. 506-51

No abstract

The incidence of DDH in Taiwan was reported as 1.2 per thousand, so 40% of the DDH children underwent surgery. However, with 87% of surgeries occurring after walking age, it is reasonable to postulate that the screening program was not performed accurately or universally. The rate of major procedures in surgical cases of DDH is a better indicator for the effectiveness of mass screening.

In this Asian population-based cohort, alcohol was associated with pancreatitis in a dose-dependent way, but smoking was not associated with pancreatitis. These results support for ethnic differences in susceptibility to smoking- and alcohol-related pancreatitis.

No abstract