Folgen
JR Sack
Titel
Zitiert von
Zitiert von
Jahr
Handbook of computational geometry
JR Sack, J Urrutia
Elsevier, 1999
5911999
Min-max heaps and generalized priority queues
MD Atkinson, JR Sack, N Santoro, T Strothotte
Communications of the ACM 29 (10), 996-1000, 1986
2391986
Approximating weighted shortest paths on polyhedral surfaces
M Lanthier, A Maheshwari, JR Sack
Proceedings of the thirteenth annual symposium on Computational geometry …, 1997
2231997
Determining approximate shortest paths on weighted polyhedral surfaces
L Aleksandrov, A Maheshwari, JR Sack
Journal of the ACM (JACM) 52 (1), 25-53, 2005
1332005
Minimum decompositions of polygonal objects
JM Keil, JR Sack
Machine Intelligence and Pattern Recognition 2, 197-216, 1985
1301985
Approximation algorithms for geometric shortest path problems
L Aleksandrov, A Maheshwari, JR Sack
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1202000
An ε—approximation algorithm for weighted shortest paths on polyhedral surfaces
L Aleksandrov, M Lanthier, A Maheshwari, JR Sack
Algorithm Theory—SWAT'98: 6th Scandinavian Workshop on Algorithm Theory …, 1998
1181998
Computing the link center of a simple polygon
W Lenhart, R Pollack, J Sack, R Seidel, M Sharir
Proceedings of the third annual symposium on Computational geometry, 1-10, 1987
991987
Simple algorithms for enumerating interpoint distances and finding k nearest neighbors
MT Dickerson, RLS Drysdale, JR Sack
International Journal of Computational Geometry & Applications 2 (03), 221-239, 1992
981992
Link distance problems
A Maheshwari, JR Sack, HN Djidjev
Handbook of Computational Geometry, 519-558, 2000
652000
Algorithm for Decomposing Simple Rectilinear Polygons into Convex Quadrilaterals,"
J Sack, O An
Proceedings of the 20th Allerton Conference on Communication, Control, and …, 1982
651982
An optimal algorithm for detecting weak visibility of a polygon: Preliminary version
JR Sack, S Suri
Annual Symposium on Theoretical Aspects of Computer Science, 312-321, 1988
601988
Shortest paths in time-dependent FIFO networks
F Dehne, MT Omran, JR Sack
Algorithmica 62 (1), 416-435, 2012
582012
Shortest anisotropic paths on terrains
M Lanthier, A Maheshwari, JR Sack
Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 1999
561999
Generating binary trees at random
MD Atkinson, JR Sack
Information Processing Letters 41 (1), 21-23, 1992
531992
Rectilinear computational geometry
JR Sack
McGill University, 1984
521984
AnO(n logn) algorithm for computing the link center of a simple polygon
HN Djidjev, A Lingas, JR Sack
Discrete & Computational Geometry 8 (2), 131-152, 1992
511992
Fréchet distance with speed limits
A Maheshwari, JR Sack, K Shahbaz, H Zarrabi-Zadeh
Computational Geometry 44 (2), 110-120, 2011
492011
Parallel implementation of geometric shortest path algorithms
M Lanthier, D Nussbaum, JR Sack
Parallel Computing 29 (10), 1445-1479, 2003
492003
Guard placement in rectilinear polygons
JR Sack, GT Toussaint
Machine Intelligence and Pattern Recognition 6, 153-175, 1988
481988
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20