Before the advent of endovascular coiling, patients with multiple intracranial aneurysms were treated with surgical clipping; however, with the advancements in endovascular technology, intracranial aneurysms can be treated with surgical clipping and/or endovascular coiling. We describe a case of subarachnoid hemorrhage in a patient with 7 intracranial aneurysms. A 45-year-old female developed a...

BACKGROUND Treatment of anterior choroidal artery (AChA) aneurysms with endovascular coiling or surgical clipping may increase the risk of ischemic complications owing to the critical territory supplied by the AChA. We analyzed the surgical results of endovascular coiling and surgical clipping for AChA aneurysms performed in a single institution, as well as the role of indocyanine green-videoan...

BACKGROUND Intestinal parasitic infections are highly endemic among school-aged children in resource-limited settings. To lower their impact, preventive measures should be implemented that are sustainable with available resources. The aim of this study was to assess the impact of handwashing with soap and nail clipping on the prevention of intestinal parasite reinfections. METHODS AND FINDING...

See related article, pages ●●●–●●● Early aneurysm repair to prevent recurrent bleeding is central to the management of patients with subarachnoid hemorrhage. Over the past 15 years, endovascular occlusion of cerebral aneurysms has emerged as an alternative to microsurgical clipping, and the relative merits and shortcomings of these 2 approaches have been the subject of considerable discussion i...

This short paper introduces a new approach to finding ray– patch intersections with triangular Bernstein–Bézier patches of arbitrary degree. Unlike a previous approach based on a combination of hierarchical subdivision and a Newton–like iteration scheme [7], this work extends the concept of Bézier clipping to the triangular domain. The problem of reporting wrong intersections, inherent to the o...

A new O N (lg ) line clipping algorithm in E against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.

A classic problem in computer graphics is to decompose a simple polygon into a collection of triangles whose vertices are only those of the simple polygon. By definition, a simple polygon is an ordered sequence of n points, ~ V0 through ~ Vn−1. Consecutive vertices are connected by an edge 〈~ Vi, ~ Vi+1〉, 0 ≤ i ≤ n − 2, and an edge 〈~ Vn−1, ~ V0〉 connects the first and last points. Each vertex ...