51 search results - page 1 / 11 » Approximating (r, p)-Centroid on a Path |
COLOGNETWENTE
2008
13 years 6 months ago
2008
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
SIAMCOMP
1998
13 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...