Pat Morin
-
- Computational Geometry and Mesh Generation 81
- Computer Networks and Communications top 0.5%
- Optimization and Search Problems 10
-
- Advanced Graph Theory Research 38
- Complexity and Algorithms in Graphs 20
- Graph Labeling and Dimension Problems 8
- Signal Processing top 5%
- Data Management and Algorithms 26
-
- Digital Image Processing Techniques 24
-
- Algorithms and Data Compression 20
- Co-authors
- Prosenjit BoseJorge UrrutiaIvan StojmenovićVida DujmovićStefan LangermanDavid R. WoodAnil MaheshwariJohn Iacono
- Cited by
- Computer Graphics and Computer-Aided DesignComputer Networks and CommunicationsComputational Theory and Mathematics
- Journals
- Computational Geometry (17 papers)Discrete & Computational Geometry (8 papers)Algorithmica (7 papers)
- Partner nations
- CanadaUnited StatesBelgium
In The Last Decade
Pat Morin
115 papers receiving 2.3k citations
Hit Papers
Peers
Comparison fields: 5 of 107
- Computer Graphics and Computer-Aided Design 497
- Computer Networks and Communications 1.6k
- Computational Theory and Mathematics 351
- Signal Processing 191
- Discrete Mathematics and Combinatorics 48
Countries citing papers authored by Pat Morin
This map shows the geographic impact of Pat Morin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pat Morin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pat Morin more than expected).
Fields of papers citing papers by Pat Morin
This network shows the impact of papers produced by Pat Morin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pat Morin. The network helps show where Pat Morin may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Pat Morin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 1 | |
| 2 | 2023 | 1 | |
| 3 | 2023 | 12 | |
| 4 | 2015 | 1 | |
| 5 | Optimal Bounds on Theta-Graphs: More is not Always Better. | 2012 | 1 |
| 6 | Algorithms for Bivariate Majority Depth. | 2011 | 1 |
| 7 | 2011 | 0 | |
| 8 | 2011 | 5 | |
| 9 | Oja Medians and Centers of Mass | 2010 | 1 |
| 10 | 2009 | 3 | |
| 11 | 2009 | 3 | |
| 12 | 2008 | 4 | |
| 13 | Distribution-sensitive point location in convex subdivisions | 2007 | 7 |
| 14 | Removing Outliers to Minimize Area and Perimeter | 2006 | 2 |
| 15 | 2006 | 1 | |
| 16 | Unfolding polyhedral bands | 2004 | 1 |
| 17 | GeoWall-2 : a Scalable Display System for the Geosciences | 2003 | 1 |
| 18 | 2002 | 1 | |
| 19 | Competitive Online Routing in Geometric Graphs. | 2001 | 3 |
| 20 | STATEWIDE PROGRAMMING: IMPLEMENTING TRANSPORTATION-POLICY OBJECTIVES. CASE STUDY | 1996 | 0 |
About Pat Morin
Pat Morin is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Signal Processing, Computer Vision and Pattern Recognition and Discrete Mathematics and Combinatorics, having authored 133 papers that have together received 2.5k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (81 papers), Advanced Graph Theory Research (38 papers), Data Management and Algorithms (26 papers), Digital Image Processing Techniques (24 papers), Complexity and Algorithms in Graphs (20 papers), Algorithms and Data Compression (20 papers), Optimization and Search Problems (10 papers) and Graph Labeling and Dimension Problems (8 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (497 citations), Computer Networks and Communications (1.6k citations), Computational Theory and Mathematics (351 citations), Signal Processing (191 citations) and Discrete Mathematics and Combinatorics (48 citations). Pat Morin has collaborated with scholars based in Canada, United States and Belgium. Frequent co-authors include Prosenjit Bose, Jorge Urrutia, Ivan Stojmenović, Vida Dujmović, Stefan Langerman, David R. Wood, Anil Maheshwari, John Iacono, Luc Devroye and Godfried Toussaint. Their work appears in journals such as Computational Geometry, Discrete & Computational Geometry, Algorithmica, SIAM Journal on Computing and The Electronic Journal of Combinatorics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.