Get started
Author

Jörg-Rüdiger Sack

Observed names: J. -R. Sack, J. R. Sack, J. Rudiger Sack, J. Sack, J.-R. Sack, J.R. Sack, Jorg-R. SACK, Jorg-Rudiger Sack, JÖRG-RÜDIGER SACK, Jörg -R. Sack, Jörg Sack, Jörg-R. Sack, Jörg-Rudiger Sack, Sack, J R, Sack, J., Sack, J.R., Sack, Jorg-Rudiger, Sack, Jörg-Rüdiger, Sack, Jörg-Rüdiger, Sack, Jörg-Rüdiger.
Institution: Carleton University
Observed institutions: University of Bonn, Max Planck Society, University of Ottawa, University of St Andrews, Brown University, Max Planck Institute for Informatics, McGill University, Carleton University
ORCID: 0000-0001-5936-1319
Observed ORCID: 0000-0001-5936-1319
OpenAlex ID: A5085978384
Algorithms and Data Structures
2001 · Dehne, Frank, Tamassia, Roberto, et al. · Lecture notes in computer science · 624
Proceedings of the 8th Canadian Conference on Computational Geometry
1996 · Frank Fiala, Evangelos Kranakis, et al. · 207
Min-max heaps and generalized priority queues
1986 · M. D. Atkinson, J.-R. Sack, et al. · Communications of the ACM · 170
Approximating weighted shortest paths on polyhedral surfaces
1997 · Mark Lanthier, Anil Maheshwari, et al. · 133
Determining approximate shortest paths on weighted polyhedral surfaces
2005 · L. Aleksandrov, A. Maheshwari, et al. · Journal of the ACM · 117
Approximation algorithms for geometric shortest path problems
2000 · Lyudmil Aleksandrov, Anil Maheshwari, et al. · ACM Symposium on Theory of Computing (STOC) · 76
PDF
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
1998 · Lyudmil Aleksandrov, Mark Lanthier, et al. · Lecture notes in computer science · 75
PDF
Approximating Shortest Paths on Weighted Polyhedral Surfaces
2001 · M. Lanthier, A. Maheshwari, et al. · Algorithmica · 70
Canadian Conference on Computational Geometry
1996 · Frank Fiala, Evangelos Kranakis, et al. · McGill-Queen's University Press eBooks · 70
Minimum Decompositions of Polygonal Objects
1985 · J. Mark KEIL, Jorg-R. SACK · Machine intelligence and pattern recognition · 70
Computing the link center of a simple polygon
1987 · W. Lenhart, R. Pollack, et al. · Annual Symposium on Computational Geometry (SoCG) · 61
PDF
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
1992 · MATTHEW T. DICKERSON, R.L. SCOT DRYSDALE, et al. · International Journal of Computational Geometry & Applications · 53
Link Distance Problems
2000 · Anil Maheshwari, Jörg-Rüdiger Sack, et al. · Elsevier eBooks · 43
Shortest Paths in Time-Dependent FIFO Networks
2010 · Frank Dehne, Masoud T. Omran, et al. · Algorithmica · 42
Obfuscation of images via differential privacy: From facial images to general images
2021 · William L. Croft, Jörg-Rüdiger Sack, et al. · Peer-to-Peer Networking and Applications · 40
PDF
Fréchet distance with speed limits
2010 · Anil Maheshwari, Jörg-Rüdiger Sack, et al. · Computational Geometry · 39
PDF
Computing the link center of a simple polygon
1988 · W. Lenhart, R. Pollack, et al. · Discrete & Computational Geometry · 39
PDF
Shortest Anisotropic Paths on Terrains
1999 · Mark Lanthier, Anil Maheshwari, et al. · Lecture notes in computer science · 38
An optimal algorithm for detecting weak visibility of a polygon
1990 · J.-R. Sack, S. Suri · IEEE Transactions on Computers · 38
Differential Privacy via a Truncated and Normalized Laplace Mechanism
2022 · William Croft, Jörg-Rüdiger Sack, et al. · Journal of Computer Science and Technology · 35
PDF
Rectilinear computational geometry
1984 · Sack, Jörg-Rüdiger. · eScholarship@McGill (McGill) · 35
PDF
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
2009 · Lyudmil Aleksandrov, Hristo N. Djidjev, et al. · Discrete & Computational Geometry · 33
PDF
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces
1998 · Lyudmil Aleksandrov, Mark Lanthier, et al. · Scandinavian Workshop on Algorithm Theory · 32
Approximating weighted shortest paths on polyhedral surfaces
1997 · Mark Lanthier, Anil Maheshwari, et al. · 32
PDF
Parallel implementation of geometric shortest path algorithms
2003 · Mark Lanthier, Doron Nussbaum, et al. · Parallel Computing · 31
Works count: 193
Citation count: 3,322
H-index: 28
I10-index: 72
Year
Topic
Type