The following pages link to Jörg-Rüdiger Sack (Q170449):
Displaying 30 items.
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- Determining approximate shortest paths on weighted polyhedral surfaces (Q3546286) (← links)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311) (← links)
- (Q3683086) (← links)
- Min-max heaps and generalized priority queues (Q3783545) (← links)
- (Q3785935) (← links)
- (Q3787487) (← links)
- (Q3787488) (← links)
- (Q3795225) (← links)
- (Q3796757) (← links)
- (Q3820006) (← links)
- (Q3827554) (← links)
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (Q4030349) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY (Q4820063) (← links)
- Generating triangulations at random (Q4876039) (← links)
- (Q4945513) (← links)
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
- (Q5186269) (← links)
- Efficient, Decentralized Computation of the Topology of Spatial Regions (Q5280544) (← links)
- DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS (Q5289295) (← links)
- Approximating the Integral Fréchet Distance (Q5369528) (← links)
- An optimal algorithm for detecting weak visibility of a polygon (Q5375451) (← links)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces (Q5756700) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
- Ray shooting from convex ranges (Q5929310) (← links)
- Approximating shortest paths on weighted polyhedral surfaces (Q5940611) (← links)
