Objective The National Institutes of Health recommends readability of patient material not exceed sixth-grade level. Our aim was to determine readability of American Urogynecologic Society (AUGS) and International Urogynecological Association (IUGA) patient education documents. Methods Available English- and Spanish-language IUGA patient information leaflets and AUGS patient fact sheets were scored for grade reading level. Readability assessment was performed using Flesch-Kincaid, Simple Measure of Gobbledygook, and Fry graph formulas for English documents. For Spanish documents, Fernandez-Huerta and SOL readability formulas were utilized. Each document was assessed by a health literacy expert using standards of plain language best practices. Results We assessed 86 documents: 18 AUGS, 34 IUGA, and 34 IUGA Spanish documents. Readability combined scores for English AUGS documents ranged from 8th to 12th grade level equivalents, whereas English IUGA documents ranged from 7th to 13th. Combined average readability score for AUGS sheets was 9.9 ± 1.2 grade level equivalents versus 10.5 ± 1.3 for IUGA leaflets. The AUGS documents had lower grade level equivalents on all 3 readability scales. Spanish-language IUGA leaflets had an average readability score of 5.9 ± 0.6 grade level equivalents, with a range of fifth to seventh. Health literacy expert analysis found only 1 document met all the criteria for plain language best practice. Conclusions All assessed AUGS and IUGA patient information English documents had readability scores above National Institutes of Health–recommended reading level. Spanish IUGA documents were written at a lower reading level than their English counterparts. To best meet patient education needs, future materials development should emphasize readability and utilization of plain language best practices.

We study a turn-based game in a simply connected polygonal environment Q between a pursuer P and an adversarial evader E. Both players can move in a straight line to any point within unit distance during their turn. The pursuer P wins by capturing the evader, meaning that their distance satisfies d(P, E) ≤ 1, while the evader wins by eluding capture forever. Both players have a map of the environment, but they have different sensing capabilities. The evader E always knows the location of P. Meanwhile, P only has line-of-sight visibility: P observes the evader's position only when the line segment connecting them lies entirely within the polygon. Therefore P must search for E when the evader is hidden from view.We provide a winning strategy for P in the family of strictly sweepable polygons, meaning that a straight line L can be moved continuously over Q so that (1) L ∩ Q is always convex and (2) every point on the boundary ∂Q is swept exactly once. This strict sweeping requires that L moves along Q via a sequence of translations and rotations. We develop our main result by first considering pursuit in the subfamilies of monotone polygons (where L moves by translation) and scallop polygons (where L moves by a single rotation). Our algorithm uses rook strategy during its active pursuit phase, rather than the well-known lion strategy. The rook strategy is crucial for obtaining a capture time that is linear in the area of Q. For monotone and scallop polygons, our algorithm has a capture time of O(n(Q) + area(Q)), where n(Q) is the number of polygon vertices. The capture time bound for strictly sweepable polygons is O(n(Q) • area(Q)).

We study a turn-based game in a simply connected polygonal environment [Formula: see text] between a pursuer [Formula: see text] and an adversarial evader [Formula: see text]. Both players can move in a straight line to any point within unit distance during their turn. The pursuer [Formula: see text] wins by capturing the evader, meaning that their distance satisfies [Formula: see text], while the evader wins by eluding capture forever. Both players have a map of the environment, but they have different sensing capabilities. The evader [Formula: see text] always knows the location of [Formula: see text]. Meanwhile, [Formula: see text] only has line-of-sight visibility: [Formula: see text] observes the evader’s position only when the line segment connecting them lies entirely within the polygon. Therefore [Formula: see text] must search for [Formula: see text] when the evader is hidden from view. We provide a winning strategy for [Formula: see text] in two families of polygons: monotone polygons and scallop polygons. In both families, a straight line [Formula: see text] can be moved continuously over [Formula: see text] so that (1) [Formula: see text] is a line segment and (2) every point on the boundary [Formula: see text] is swept exactly once. These are both subfamilies of strictly sweepable polygons. The sweeping motion for a monotone polygon is a single translation, and the sweeping motion for a scallop polygon is a single rotation. Our algorithms use rook’s strategy during its pursuit phase, rather than the well-known lion’s strategy. The rook’s strategy is crucial for obtaining a capture time that is linear in the area of [Formula: see text]. For both monotone and scallop polygons, our algorithm has a capture time of [Formula: see text], where [Formula: see text] is the number of polygon vertices.