Pat Morin

Q: What Schools Are Affiliated With Pat Morin

Pat Morin is affiliated with the following schools: University of British Columbia, Carleton University

Pat Morin's AcademicInfluence.com Rankings

Pat Morin

Computer Science

#428

World Rank

#445

Historical Rank

Database

#692

World Rank

#726

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Pat Morin's Degrees

PhD Computer Science University of British Columbia
Masters Computer Science University of British Columbia
Bachelors Computer Science University of British Columbia

Similar Degrees You Can Earn

Why Is Pat Morin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, 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.

(See a Problem?)

Pat Morin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks (1999) (2038)
Online Routing in Triangulations (1999) (321)
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries (2003) (207)
On the false-positive rate of Bloom filters (2008) (185)
Online Routing in Convex Subdivisions (2000) (101)
Layout of Graphs with Bounded Tree-Width (2004) (101)
Fast approximations for sums of distances, clustering and the Fermat-Weber problem (2003) (93)
Planar Graphs have Bounded Queue-Number (2019) (84)
Cuckoo hashing: Further analysis (2003) (76)
Covering Things with Things (2002) (75)
Range Mode and Range Median Queries on Lists and Trees (2003) (71)
Competitive Online Routing in Geometric Graphs (2004) (67)
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (2009) (66)
Algorithms and Computation (2002) (66)
Layered separators in minor-closed graph classes with applications (2013) (62)
Space-efficient planar convex hull algorithms (2004) (55)
Online routing in geometric graphs (2001) (54)
On simplifying dot maps (2004) (50)
Ordered theta graphs (2004) (50)
Bounds for Frequency Estimation of Packet Streams (2003) (44)
Notes on Large Angle Crossing Graphs (2009) (44)
Output-sensitive algorithms for Tukey depth and related problems (2008) (41)
Improving Distance Based Geographic Location Techniques in Sensor Networks (2004) (39)
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D (2008) (38)
Adjacency Labelling for Planar Graphs (and Beyond) (2020) (35)
An Improved Algorithm for Subdivision Traversal without Extra Storage (2000) (35)
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended (2011) (35)
Randomized Rendez-Vous with Limited Memory (2008) (34)
Space-efficient geometric divide-and-conquer algorithms (2007) (32)
Array Layouts for Comparison-Based Searching (2015) (32)
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs (2002) (32)
Algorithms for optimal outlier removal (2009) (31)
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles (2002) (31)
The θ 5-Graph is a Spanner (2012) (31)
Approximate Range Mode and Range Median Queries (2005) (30)
Graph product structure for non-minor-closed classes (2019) (30)
The Impact of Self-Similarity on Network Performance Analysis (1995) (29)
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing (2004) (28)
Geodesic Ham-Sandwich Cuts (2004) (27)
Simultaneous diagonal flips in plane triangulations (2005) (26)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
Absolute approximation of Tukey depth: Theory and experiments (2013) (26)
Towards tight bounds on theta-graphs: More is not always better (2016) (24)
Robust geometric spanners (2012) (23)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Progressive TINs: algorithms and applications (1997) (19)
Asymmetric Communication Protocols via Hotlink Assignments (2003) (19)
In-Place Planar Convex Hull Algorithms (2002) (18)
Common Unfoldings of Polyominoes and Polycubes (2010) (17)
Succinct geometric indexes supporting point location queries (2008) (17)
Planar visibility: testing and counting (2010) (16)
Clustered 3-colouring graphs of bounded degree (2020) (16)
Edge-unfolding nested polyhedral bands (2008) (16)
On Worst-Case Robin Hood Hashing (2004) (16)
Distinct Distances in Graph Drawings (2008) (15)
Optimal Bounds on Theta-Graphs: More is not Always Better (2012) (15)
The structure of k-planar graphs (2019) (14)
Fast local searches and updates in bounded universes (2013) (14)
Sparse universal graphs for planarity (2020) (14)
Coarse grained parallel computing on heterogeneous systems (1998) (13)
Translating a regular grid over a point set (2003) (13)
Convexifying polygons with simple projections (2001) (13)
Orthogonal Tree Decompositions of Graphs (2017) (12)
A Characterization of the degree sequences of 2‐trees (2006) (12)
Improved Methods For Generating Quasi-Gray Codes (2010) (12)
Delaunay Triangulation of Imprecise Points Simplified and Extended (2009) (12)
Flipping your Lid (2001) (11)
On Obstacle Numbers (2013) (11)
Minor-closed graph classes with bounded layered pathwidth (2018) (11)
Simple polygons with an infinite sequence of deflations. (2001) (11)
Asymptotically Optimal Vertex Ranking of Planar Graphs (2020) (10)
A Fast Algorithm for the Product Structure of Planar Graphs (2020) (10)
Distribution-sensitive point location in convex subdivisions (2008) (10)
On the expected maximum degree of Gabriel and Yao graphs (2009) (10)
Stabbing Pairwise Intersecting Disks by Four Points (2018) (9)
Hash Tables (2004) (9)
More Turán-Type Theorems for Triangles in Convex Point Sets (2017) (9)
Memoryless routing in convex subdivisions: Random walks are optimal (2009) (9)
Putting your data structure on a diet (2007) (9)
Stack-Number is Not Bounded by Queue-Number (2020) (9)
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring (2013) (9)
Spanning Trees in Multipartite Geometric Graphs (2016) (9)
Open Data Structures: An Introduction (2013) (9)
Separating layered treewidth and row treewidth (2021) (9)
Three-Dimensional 1-Bend Graph Drawings (2004) (9)
Entropy, triangulation, and point location in planar subdivisions (2009) (9)
Biased Range Trees (2008) (8)
Testing the Quality of Manufactured Disks and Balls (2003) (8)
Optimal Randomized Parallel Algorithms for Computational Geometry (2007) (8)
Odd Colourings of Graph Products (2022) (8)
Testing the Quality of Manufactured Disks and Cylinders (1998) (7)
An Optimal Algorithm for Product Structure in Planar Graphs (2022) (7)
The Grid Placement Problem (2001) (7)
On the Average Number of Edges in Theta Graphs (2013) (7)
Unfolding polyhedral bands (2004) (7)
Queue Layouts of Graphs with Bounded Degree and Bounded Genus (2019) (7)
The Fresh-Finger Property (2013) (7)
Reconfiguring Triangulations with Edge Flips and Point Moves (2004) (7)
Near-Optimal O(k)-Robust Geometric Spanners (2018) (7)
Connectivity-preserving transformations of binary images (2009) (6)
Randomized rendezvous with limited memory (2011) (6)
The theta-5-graph is a spanner (2012) (6)
Oja centers and centers of gravity (2013) (6)
Skip lift: A probabilistic alternative to red-black trees (2010) (6)
A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model (2010) (6)
Approximating Majority Depth (2012) (6)
New Bounds for Facial Nonrepetitive Colouring (2016) (6)
A Distribution-Sensitive Dictionary with Low Space Overhead (2009) (5)
Crossings in Grid Drawings (2013) (5)
A History of Distribution-Sensitive Data Structures (2013) (5)
Every Collinear Set in a Planar Graph is Free (2018) (5)
Compatible Connectivity Augmentation of Planar Disconnected Graphs (2014) (5)
Odds-On Trees (2010) (5)
Sigma-local graphs (2010) (5)
Rotational Clamshell Casting In Two Dimensions (2006) (4)
Testing the Quality of Manufactured Balls (1999) (4)
Two Results on Layered Pathwidth and Linear Layouts (2020) (4)
Computing the Center of Area of a Convex Polygon (2003) (4)
Encoding Arguments (2016) (4)
Rotational Clamshell Casting In Three Dimensions (2006) (4)
A generalized Winternitz Theorem (2011) (4)
Algorithms for Bivariate Majority Depth (2011) (4)
Packing two disks into a polygonal environment (2001) (4)
Centerpoint Theorems for Wedges (2009) (4)
Algorithms for Designing Clamshell Molds (2007) (3)
Towards Tight Bounds on Theta-Graphs (2014) (3)
Algorithms for bivariate zonoid depth (2004) (3)
EPG-representations with small grid-size (2017) (3)
Removing Outliers to Minimize Area and Perimeter (2006) (3)
An optimal randomized algorithm for d-variate zonoid depth (2008) (3)
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded (2018) (3)
A Note on Interference in Random Point Sets (2012) (3)
Biased Predecessor Search (2014) (2)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
A Note on Interference in Random Networks (2012) (2)
The cost of iterator validity (2006) (2)
Realizing partitions respecting full and partial order information (2008) (2)
Spanners of Complete k -Partite Geometric Graphs (2007) (2)
Rotationally Monotone Polygons (2009) (2)
Point Location in Disconnected Planar Subdivisions (2010) (2)
The Price of Order (2014) (2)
Average Stretch Factor: How Low Does It Go? (2013) (2)
Notes on growing a tree in a graph (2017) (2)
The geometry of carpentry and joinery (2004) (1)
Algorithms and computation : 13th International Symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings (2002) (1)
Encoding 3SUM (2019) (1)
PUTTING YOUR DICTIONARY ON A DIET (2002) (1)
Covering points with lines (2001) (1)
Geodesic Obstacle Representation of Graphs (2018) (1)
Top-Down Skiplists (2014) (1)
Routing with Guaranteed Deliveryin ad ho Wireless Networks (1999) (1)
Oja Medians and Centers of Mass (2010) (1)
Biased Range Trees (2010) (1)
Guest Editor's Introduction (2014) (1)
Corrigendum: Orthogonal Tree Decompositions of Graphs (2018) (1)
First-Passage Percolation Time on Hypercubes (2017) (1)
Biased Predecessor Search (2016) (0)
An Extensible Implementation of a Balanced Binary Tree (2000) (0)
A Fast Algorithm for the Product Structure of Planar Graphs (2021) (0)
Clamshell Casting (2009) (0)
The Excluded Tree Minor Theorem Revisited (2023) (0)
Oja medians and centers of gravity (2010) (0)
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
Simple Polygons with an Innnite Sequence of Deeations (2001) (0)
Drawing Graphs as Spanners (2020) (0)
Algorithms for Marketing-Mix Optimization (2009) (0)
Compatible Connectivity Augmentation of Planar Disconnected Graphs (2015) (0)
Dual Circumference and Collinear Sets (2018) (0)
ON THE SOCIAL PROPERTIES OF A CONIC SECTION AND THE THEORY OF POLEMICAL MATHEMATICS ∗ (2010) (0)
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure (2022) (0)
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (2018) (0)
Planar Graphs have Bounded Queue-Number Vida Dujmović (2019) (0)
New Bounds for Facial Nonrepetitive Colouring (2017) (0)
Every Collinear Set in a Planar Graph is Free (2020) (0)
A Characterization of the Degree Sequences of 2-trees (2007) (0)
Spanning Trees in Multipartite Geometric Graphs (2017) (0)
Ghost chimneys (2010) (0)
Guest Editors’ Foreword (2004) (0)
Average Stretch Factor: How Low Does It Go? (2015) (0)
Reprint of: Approximating majority depth (2015) (0)
Graphs excluding a fixed minor are $O(\sqrt{n})$-complete-blowups of a treewidth 4 graph (2022) (0)
Proceedings of the 13th International Symposium on Algorithms and Computation (2002) (0)
Open Data Structures (in Java) (2018) (0)
ON GROWING A TREE IN A GRAPH À (2017) (0)
Pa king Two Disks into a PolygonalEnvironment ? (2001) (0)
Two Topics in Applied Algorithmics Two Topics in Applied Algorithmics Submitted by I Coarse Grained Parallel Computing on Heterogeneous Systems 1 (1998) (0)
Geometric Divide-and-Conquer Algorithms (2004) (0)
Searching by Panning and Zooming (2014) (0)
Unfolding Polyhedral (2007) (0)
Succinct Data Structures for Approximating Convex Functions with Applications (2002) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)
2×n Grids have Unbounded Anagram-Free Chromatic Number (2021) (0)
Layered Pathwidth and Graph Layouts (2019) (0)
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number (2021) (0)
Flipping your (2000) (0)
EPG-representations with small grid-size (cid:63) (2018) (0)
On Simplifying Dot Maps ( abstract ) (0)
Visibility Monotonic Polygon Deflation (2012) (0)
Linear versus centred chromatic numbers (2022) (0)

This paper list is powered by the following services:

Other Resources About Pat Morin

What Schools Are Affiliated With Pat Morin?

Pat Morin is affiliated with the following schools:

Pat Morin's Academic­Influence.com Rankings