|
Pat Morin
Patrick Ryan Morin is a Canadian computer scientist specializing in computational geometry and data structures. He is a professor in the School of Computer Science at Carleton University. Education and career Morin was educated at Carleton University, earning a bachelor's degree with highest honours in 1996, a master's degree in 1998, and a Ph.D. in 2001. His dissertation, ''Online Routing in Geometric Graphs'', was jointly supervised by Jit Bose and Jörg-Rüdiger Sack. After postdoctoral research at McGill University, he returned to Carleton University as a faculty member in 2002. Contributions Morin has published highly-cited work on geographic routing in geometric graphs, including unit disk graphs and triangulations, with coauthors including Jit Bose, Erik Demaine, Stefan Langerman, and Jorge Urrutia. With Joachim Gudmundsson, he co-founded the ''Journal of Computational Geometry'', and continues as its managing editor. He is the author of an open textbook on data structu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity. Analysis of algorithms, Computational complexity is central to computational geometry, with great practical significance if algorithms are used on very large datasets containing tens or hundreds of millions of points. For such sets, the difference between O(''n''2) and O(''n'' log ''n'') may be the difference between days and seconds of computation. The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (Computer-aided design, CAD/Compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stefan Langerman
Stefan Langerman false Swarzberg is a Belgian computer scientist and mathematician whose research topics include computational geometry, data structures, and recreational mathematics. He is professor and co-head of the algorithms research group at the Université libre de Bruxelles (ULB) with Jean Cardinal. He is a director of research for the Belgian Fonds de la Recherche Scientifique (FRS–FNRS). Education and career Langerman left his Belgian secondary school at age 13 and was admitted by examination to the École polytechnique of the Université libre de Bruxelles. He studied civil engineering there for two years before switching his course of study to computer science, and earning a licenciate. After working as a user interface programmer for the Center for Digital Molecular Biophysics in Gembloux, he moved to the US for graduate study at Rutgers University, where he earned a master's degree and then in 2001 a PhD. His doctoral dissertation, ''Algorithms and Data Structur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Researchers In Geometric Algorithms
Research is " creative and systematic work undertaken to increase the stock of knowledge". It involves the collection, organization and analysis of evidence to increase understanding of a topic, characterized by a particular attentiveness to controlling sources of bias and error. These activities are characterized by accounting and controlling for biases. A research project may be an expansion on past work in the field. To test the validity of instruments, procedures, or experiments, research may replicate elements of prior projects or the project as a whole. The primary purposes of basic research (as opposed to applied research) are documentation, discovery, interpretation, and the research and development (R&D) of methods and systems for the advancement of human knowledge. Approaches to research depend on epistemologies, which vary considerably both within and between humanities and sciences. There are several forms of research: scientific, humanities, artistic, econom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Canadian Computer Scientists
Canadians (french: Canadiens) are people identified with the country of Canada. This connection may be residential, legal, historical or cultural. For most Canadians, many (or all) of these connections exist and are collectively the source of their being ''Canadian''. Canada is a multilingual and multicultural society home to people of groups of many different ethnic, religious, and national origins, with the majority of the population made up of Old World immigrants and their descendants. Following the initial period of French and then the much larger British colonization, different waves (or peaks) of immigration and settlement of non-indigenous peoples took place over the course of nearly two centuries and continue today. Elements of Indigenous, French, British, and more recent immigrant customs, languages, and religions have combined to form the culture of Canada, and thus a Canadian identity. Canada has also been strongly influenced by its linguistic, geographic, and ec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year or annus is the orbital period of a planetary body, for example, the Earth, moving in its orbit around the Sun. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by change in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons are generally recognized: spring, summer, autumn and winter. In tropical and subtropical regions, several geographical sectors do not present defined seasons; but in the seasonal tropics, the annual wet and dry seasons are recognized and tracked. A calendar year is an approximation of the number of days of the Earth's orbital period, as counted in a given calendar. The Gregorian calendar, or modern calendar, presents its calendar year to be either a common year of 365 days or a leap year of 366 days, as do the Julian calendars. For the Gregorian calendar, the average length of the calendar year (the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open Textbook
An open textbook is a textbook licensed under an open license, and made available online to be freely used by students, teachers and members of the public. Many open textbooks are distributed in either print, e-book, or audio formats that may be downloaded or purchased at little or no cost.Learn More About Open Textbooks the Student PIRGs Part of the broader movement, open textbooks increasingly are seen as a solution to challenges with traditionally published textbooks, such as access and affordability concerns. Open textbooks were identified in the [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Computational Geometry
The ''Journal of Computational Geometry'' (JoCG) is an open access mathematics journal that was established in 2010. It covers research in all aspects of computational geometry. All its papers are published free of charge to both authors and readers, and are made freely available through a Creative Commons Attribution license. The current editors-in-chief are Kenneth L. Clarkson and Günter Rote. Along with its regularly contributed papers, the journal has since 2014 invited selected papers from the annual Symposium on Computational Geometry to a special issue. Abstracting and indexing The ''Journal of Computational Geometry'' is abstracted and indexed in MathSciNet, ''Zentralblatt Math'', and the Emerging Sources Citation Index. Long-term preservation of journal contents are ensured by the journal's membership in the Global LOCKSS Network. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jorge Urrutia Galicia
Jorge Urrutia Galicia is a Mexican mathematician and computer scientist in the Institute of Mathematics of the National Autonomous University of Mexico (UNAM). His research primarily concerns discrete and computational geometry. Education and career Urrutia earned his Ph.D. from the University of Waterloo in 1980, under the supervision of Ronald C. Read. He worked for many years at the University of Ottawa before moving to UNAM in 1999.Jorge Urrutia Galicia , Mexican Conference on Discrete Mathematics and Computational Geometry, retrieved 2015-03-23. With Jörg-Rüdiger Sack in 1991, he was founding co-editor-in-chief of the |
Erik Demaine
Erik D. Demaine (born February 28, 1981) is a professor of computer science at the Massachusetts Institute of Technology and a former child prodigy. Early life and education Demaine was born in Halifax, Nova Scotia, to artist sculptor Martin L. Demaine and Judy Anderson. From the age of 7, he was identified as a child prodigy and spent time traveling across North America with his father. He was home-schooled during that time span until entering university at the age of 12. Demaine completed his bachelor's degree at 14 years of age at Dalhousie University in Canada, and completed his PhD at the University of Waterloo by the time he was 20 years old. Demaine's PhD dissertation, a work in the field of computational origami, was completed at the University of Waterloo under the supervision of Anna Lubiw and Ian Munro. This work was awarded the Canadian Governor General's Gold Medal from the University of Waterloo and the NSERC Doctoral Prize (2003) for the best PhD thesis an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Data Structure
In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. Usage Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type. Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers. Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangulation (geometry)
In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric object into simplices. Triangulations of a three-dimensional volume would involve subdividing it into tetrahedra packed together. In most instances, the triangles of a triangulation are required to meet edge-to-edge and vertex-to-vertex. Types Different types of triangulations may be defined, depending both on what geometric object is to be subdivided and on how the subdivision is determined. * A triangulation T of \mathbb^d is a subdivision of \mathbb^d into d-dimensional simplices such that any two simplices in T intersect in a common face (a simplex of any lower dimension) or not at all, and any bounded set in \mathbb^d intersects only finitely many simplices in T. That is, it is a locally finite simplicial complex that covers the entire space. * A point-set triangulation, i.e., a triangulation of a discrete set of points \mathcal\su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
