Joseph O'Rourke (other)
Joseph O'Rourke may refer to: *Joseph Cornelius O'Rourke (1772–1849), Russian nobleman and military leader *Joseph O'Rourke (professor), researcher in computational geometry *Joseph O'Rourke (activist) Joseph F. O'Rourke (May 15, 1938 – July 24, 2008) was a laicized Catholic priest and American pro-choice activist. Biography Joseph F. "Joe" O'Rourke was born in 1938, two days after the death of his father, in Hudson, New York.Becker, Jose ...

Joseph Cornelius O'Rourke
Count Joseph Cornelius O'Rourke (Russian language, Russian: Иосиф Корнилович Орурк; also Ioseph Kornilovich O'Rourke) (1772–1849) was a Russian nobility, Russian nobleman and military leader of Irish origin who fought in the Napoleonic Wars and achieved the rank of lieutenant general. He is noted for leading a campaign against the Turks in present-day Serbia, where a combined Russian and Serb army defeated the Ottoman Empire at Varvarin in 1810. O'Rourke was awarded the orders of Saint George, Alexander Nevsky, and Saint Anne for his military victories. His portrait was included in the Military Gallery of the Winter Palace, now part of the Hermitage Museum. A monument commemorating O'Rourke and his men was erected in Varvarin in 1910 on the centennial celebration of their victory against the Ottoman Empire, Turks. Background The O'Rourke (Livonian family), O'Rourke family were originally members of the Jacobitism, Jacobite Irish nobility, Irish Nobility; th ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Joseph O'Rourke (professor)
Joseph O'Rourke is the Spencer T. and Ann W. Olin Professor of Computer Science at Smith College and the founding chair of the Smith computer science department. His main research interest is computational geometry. One of O'Rourke's early results was an algorithm for finding the minimum bounding box of a point set in three dimensions when the box is not required to be axis-aligned. The problem is made difficult by the fact that the optimal box may not share any of its face planes with the convex hull of the point set. Nevertheless, O'Rourke found an algorithm for this problem with running time O(n^3). In 1985, O'Rourke was the program chair of the first annual Symposium on Computational Geometry. He was formerly the arXiv moderator for computational geometry and discrete mathematics. In 2012 O'Rourke was named a Fellow of the Association for Computing Machinery A fellow is a concept whose exact meaning depends on context. In learned or professional societies, it refers to ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]