Jörg-Rüdiger Sack
#41,467
Most Influential Person Now
German computer scientist
Jörg-Rüdiger Sack's AcademicInfluence.com Rankings
Jörg-Rüdiger Sackmathematics Degrees
Mathematics
#3632
World Rank
#5330
Historical Rank
Graph Theory
#84
World Rank
#92
Historical Rank
Geometry
#63
World Rank
#111
Historical Rank
Measure Theory
#3461
World Rank
#4085
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Jörg-Rüdiger Sack Influential?
(Suggest an Edit or Addition)According to Wikipedia, Jörg-Rüdiger Wolfgang Sack is a professor of computer science at Carleton University, where he is Chancellor's Professor. </ref> Sack received a master's degree from the University of Bonn in 1979 and a Ph.D. in 1984 from McGill University, under the supervision of Godfried Toussaint. He is co-editor-in-chief and executive editor of the journal Computational Geometry: Theory and Applications, co-editor of the Handbook of Computational Geometry , and co-editor of the proceedings of the biennial Algorithms and Data Structures Symposium . He was a co-founding editor-in-chief of the open access Journal of Spatial Information Science but is no longer an editor there. Sack's research interests include computational geometry, data structures and geographic information systems.
Jörg-Rüdiger Sack'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
- Handbook of computational geometry (2000) (582)
- Min-max heaps and generalized priority queues (1986) (179)
- Approximating weighted shortest paths on polyhedral surfaces (1997) (160)
- Determining approximate shortest paths on weighted polyhedral surfaces (2005) (117)
- Approximation algorithms for geometric shortest path problems (2000) (94)
- Minimum Decompositions of Polygonal Objects (1985) (84)
- Computing the link center of a simple polygon (2011) (80)
- Approximating Shortest Paths on Weighted Polyhedral Surfaces (2001) (68)
- An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces (1998) (63)
- Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors (1992) (56)
- α-Visibility (2012) (56)
- Link Distance Problems (2000) (52)
- Shortest Anisotropic Paths on Terrains (1999) (48)
- An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon (1989) (46)
- An Optimal Algorithm for Detecting Weak Visibility of a Polygon (1990) (45)
- Shortest Paths in Time-Dependent FIFO Networks (2012) (43)
- Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces (2010) (39)
- Generating Binary Trees at Random (1992) (38)
- AnO(n logn) algorithm for computing the link center of a simple polygon (1992) (38)
- Parallel implementation of geometric shortest path algorithms (2003) (36)
- Finding paths with minimum shared edges (2011) (36)
- Fréchet distance with speed limits (2011) (35)
- Rectilinear computational geometry (1984) (35)
- An Algorithm for Merging Heaps (1985) (28)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (2010) (27)
- Generating triangulations at random (1994) (27)
- An Improved Approximation Algorithm for Computing Geometric Shortest Paths (2003) (27)
- Guard Placement in Rectilinear Polygons (1988) (26)
- Intelligent map agents — An ubiquitous personalized GIS ☆ (2007) (26)
- I/o-efficient algorithms for shortest path related problems (2002) (26)
- Computing the configuration space for a robot on a mesh-of-processors (1989) (26)
- Shortest paths in time-dependent FIFO networks using edge load forecasts (2009) (25)
- SOME NEW RESULTS ON MOVING POLYGONS IN THE PLANE. (1983) (22)
- Efficient, Decentralized Computation of the Topology of Spatial Regions (2011) (21)
- On the longest increasing subsequence of a circular list (2007) (21)
- Progressive TINs: algorithms and applications (1997) (19)
- Bounds for min-max heaps (1987) (19)
- Translating Polygons in the Plane (1985) (19)
- Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems (1989) (18)
- Improved Algorithms for Partial Curve Matching (2011) (18)
- A meeting scheduling problem respecting time and space (2008) (18)
- Approximating weighted shortest paths on polyhedral surfaces (1997) (18)
- A Characterization of Heaps and Its Applications (1990) (17)
- Similarity of polygonal curves in the presence of outliers (2012) (17)
- Staying Close to a Curve (2011) (16)
- Parallel neighbourhood modeling: research summary (1996) (15)
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces (2006) (15)
- Shortest path problems on polyhedral surfaces (2000) (14)
- Early Experiences in Implementing the Buffer Tree (1997) (13)
- Obfuscation of images via differential privacy: From facial images to general images (2021) (13)
- System development for parallel cellular automata and its applications (1999) (13)
- Pop-Stacks in Parallel (1999) (13)
- Translation separability of sets of polygons (1987) (13)
- Parallel neighbourhood modelling (1996) (12)
- Separability of pairs of polygons through single translations (1987) (12)
- Disassembling two-dimensional composite parts via translations (1989) (11)
- Recognizing polygons, or how to spy (1988) (11)
- An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains (2011) (11)
- Differentially Private Obfuscation of Facial Images (2019) (10)
- Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract) (1988) (10)
- A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors (1988) (10)
- Shortest Path Queries in Polygonal Domains (2008) (10)
- Minimizing Walking Length in Map Matching (2015) (9)
- A computational geometry workbench (1990) (9)
- Algorithms and Data Structures (2002) (9)
- Differential Privacy via a Truncated and Normalized Laplace Mechanism (2019) (9)
- Improved Approximation for Time-Dependent Shortest Paths (2014) (9)
- Location-based anonymization: comparison and evaluation of the Voronoi-based aggregation system (2016) (9)
- Parallel algorithms for rectilinear link distance problems (1993) (9)
- Approximating the integral Fréchet distance (2015) (9)
- Algorithms for minimum length partitions of polygons (1987) (8)
- Minimum backward fréchet distance (2014) (8)
- Computing on a Systolic Screen: Hulls, Contours and Applications (1987) (8)
- Optimal Parallel Algorithms for Direct Dominance Problems (1996) (8)
- Optimal parallel algorithms for rectilinear link-distance problems (1995) (7)
- Techniques to protect privacy against inference attacks in location based services (2012) (7)
- Parallel algorithms in external memory (1999) (7)
- Planar Stage Graphs: Characterizations and Applications (1997) (6)
- A survey of paralle computational geometry algorithms (1988) (6)
- On Generating Random Intervals and Hyperrectangles (1993) (6)
- Uniform Generation of Binary Trees in Parallel (1994) (6)
- Comparison of approaches of geographic partitioning for data anonymization (2017) (5)
- An algorithm for merging meaps (1985) (5)
- Weighted Region Problem in Arrangement of Lines (2013) (5)
- Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems (1999) (5)
- Speed-constrained geodesic fréchet distance inside a simple polygon (2010) (5)
- A Novel Geographic Partitioning System for Anonymizing Health Care Data (2015) (4)
- A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions (2021) (4)
- Seperability of Sets of Polygons (1986) (4)
- Geographic Partitioning Techniques for the Anonymization of Health Care Data (2015) (4)
- Floating-Point Filter for the Line Intersection Algorithm (2004) (4)
- Computational geometry algorithms for the systolic screen (1991) (4)
- A workbench for computational geometry (1994) (4)
- Differentially private facial obfuscation via generative adversarial networks (2021) (4)
- Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361] (2009) (3)
- Path Refinement in Weighted Regions (2018) (3)
- A coarse grained parallel solution to terrain simplification (1998) (3)
- How to Fit In Another Meeting (2006) (3)
- Uniform Generation of Forests of Restricted Height (1994) (3)
- An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version) (1988) (3)
- GlobeCon - A Scalable Framework for Context Aware Computing (2007) (3)
- Maintaining anonymity using -privacy (2017) (3)
- 08451 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects (2008) (3)
- An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (2007) (2)
- CANARIE'S WAVELENGTH DISK DRIVE PROJECT: Experiences From Phase I and Outlook for the Future (2003) (2)
- Algorithms and data structures : 13th international symposium, WADS 2013, London, ON, Canada, August 12-14, 2013 : proceedings (2013) (2)
- Predicting the Citation Count and CiteScore of Journals One Year in Advance (2022) (2)
- An O(n log n) Algorithm for Finding a Shortest Central Link Segment (2000) (2)
- Stage-graph Representations (1997) (2)
- Analog Parallel Algorithms for Computational Geometry (1995) (2)
- Computing Fréchet Distance with Speed Limits (2009) (2)
- 10491 Summary - Representation, Analysis and Visualization of Moving Objects (2010) (2)
- 10491 Results of the break-out group: Gulls Data (2010) (2)
- Optimal CREW-PRAM Algorithms for Direct Dominance Problems (1993) (2)
- Weighted Minimum Backward Frechet Distance (2015) (2)
- Parallel Neighborhood Modeling (1996) (2)
- A New Model in Firefighting Theory (2019) (2)
- Optimal Shooting: Characterizations and Applications (1995) (1)
- Visibility: (2014) (1)
- Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract) (1987) (1)
- A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases (2003) (1)
- Visiting All Sites with Your Dog (2012) (1)
- Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996 (1996) (1)
- Concurrent Parallel Shortest Path Computation (2005) (1)
- Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492) (2013) (1)
- Shortest Path Queries Between Geometric Objects on Surfaces (2007) (1)
- Selected papers presented at the international workshop on Algorithms and data structure (1998) (1)
- Most vital segment barriers (2019) (1)
- 08451 Summary Report - Representation, Analysis and Visualization of Moving Objects (2008) (1)
- Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings (2007) (1)
- Selected papers from the 12th annual symposium on Computational Geometry (1999) (1)
- Query Shortest Paths Amidst Growing Discs (2018) (1)
- RESEARCH ARTICLE Geographic Partitioning Techniques for the Anonymization of Health Care Data (2015) (1)
- Algorithms and data structures : 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30-August 1, 2003 : proceedings (2003) (1)
- Shortest paths among transient obstacles (2020) (1)
- Proceedings of the 10th international conference on Algorithms and Data Structures (2005) (0)
- Special Issue on Algorithms and Data Structures (WADS 2019) (2021) (0)
- Computing the visibility map of fat objects (2007) (0)
- Rectilinear Shortest Paths Among Transient Obstacles (2018) (0)
- Proceedings of the Third Workshop on Algorithms and Data Structures (1989) (0)
- Finding paths with minimum shared edges (2012) (0)
- Path Refinement in Weighted Regions (2018) (0)
- Comparison of approaches of geographic partitioning for data anonymization (2017) (0)
- Editorial (1999) (0)
- Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings (1989) (0)
- Generalized Priority Queues (0)
- Introduction to Special Issue (2007) (0)
- The Impact of Range Constraints on Utility in the Design of Differentially Private Mechanisms (2020) (0)
- Performance evaluation on GlobeCon-a scalable context management framework (2001) (0)
- Improved Algorithms for Partial Curve Matching (2013) (0)
- A new model and algorithms in firefighting theory (2021) (0)
- Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006 (2006) (0)
- Disassembling two-dimensional composite parts via translations (invited) (1989) (0)
- A note on approximations of rectilinear polygons (1995) (0)
- 06101 Abstracts Collection -- Spatial Data: mining, processing and communicating (2006) (0)
- Lossless fault-tolerant data structures with additive overhead Citation (2011) (0)
- An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures (2022) (0)
- Obituary Paul Erdos (19131996) (1997) (0)
- Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings (2019) (0)
- How to Fit In Another Meeting (2006) (0)
- Algorithms and data structures : 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001 : proceedings (2001) (0)
- Experiences with the implementation of geometric algorithms (1995) (0)
- CGTA Awards (2022) (0)
- Ray shooting from convex ranges (2001) (0)
- Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings (1991) (0)
- Geosensor Networks : Bridging Algorithms and Applications (2014) (0)
- Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings (2005) (0)
- An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures (2020) (0)
- Approximating the Integral Fr\'echet Distance (2015) (0)
- 10491 Results of the break-out group: Aggregation (2010) (0)
- 06101 Report -- Spatial Data: mining, processing and communicating (2006) (0)
- Preface: Special Issue on WADS 2017 (2019) (0)
- Editor's note (2018) (0)
- Shortest Paths in Time-Dependent FIFO Networks (2010) (0)
- Algorithms and Data Structures: 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings (Lecture Notes in Computer Science) (2005) (0)
- Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009) (0)
- Obfuscation of images via differential privacy: From facial images to general images (2021) (0)
- Flattening fixed-angle chains is strongly NP-hard Citation (2011) (0)
- Time-Dependent Shortest Path Queries Among Growing Discs (2018) (0)
- Algorithms and data structures : 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011 : proceedings (2011) (0)
- Proceedings of the 4th International Workshop on Algorithms and Data Structures (1995) (0)
- An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains (2013) (0)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (2011) (0)
This paper list is powered by the following services:
Other Resources About Jörg-Rüdiger Sack
What Schools Are Affiliated With Jörg-Rüdiger Sack?
Jörg-Rüdiger Sack is affiliated with the following schools:
