An improved algorithm for the shortest descending path on a convex terrain
Journal of Discrete Algorithms
Approximating geodesic distances on 2-manifolds in R3
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Given a finite set P⊆ℝd , called a pattern, t P (n) denotes the maximum number of translated copies of P determined by n points in ℝd . ...