Computation of the shortest path between two curves on a parametric surface by geodesic-like method

Details Computation of the shortest path between two curves on a parametric surface by geodesic-like method Computation of the shortest path between two curves on a parametric surface by geodesic-like method

2010-11-24

arxiv.org/abs/1011.5320v1

Computer Science

Computational Geometry

11 pages, 10 figures

Scientific paper

In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in $\mathbb{R}^3$. Moreover, the geodesic-like algorithm also provides an efficient approach to simulate the minimal geodesic between two holes on a NURBS surfaces.

Affiliated with

Also associated with

No associations

Rating

Computation of the shortest path between two curves on a parametric surface by geodesic-like method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computation of the shortest path between two curves on a parametric surface by geodesic-like method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of the shortest path between two curves on a parametric surface by geodesic-like method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240610