# Algorithm, Mathematics Job by carlosferreira

Budget $20 USD / hour

Hello.

I would like to ask you if you are available to work in 1 project than envolves geometry.

1 - I have the problem of intersection between 2 surfaces.

2 - Each surface is a parametrization of a uv plane

3 - Each uv parametrization may not be explicit, and the functional XYZ(u,v) may be an event.

4 - I want to detect all the curves and points of intersection between the 2 surfaces assuming that no regions of the surfaces are coincident in any planar region of the uv plane ( only curves and points are possible as intersection)

5 - Each curve of the intersection has the following information:

3Dpoint1 - Initial point

3DPoint2 - Final points ( can be equal to first)

YXZ(t) - The 3D parametrization of the curve. It will be also implicit and possible to obtain using curve crawling and other techniques

UV(Surface,t) - The implicit parametric curve in a UV plane of a given surface. If Surface is one of the surfaces that gave origin to the intersection, it is like mappign the 3D implicit curve to the uv parametrization of the initial surfaces.

6 - The intersection algorithm has some stages:

a) Pre detection using dual surface tesselation . for each surface create 2 tesselated or triangulated surfaces that contain the real surface

b) Calculatino of the number of curves using tesselation refinement and trying to find

special intersection points or intersection curves.

c) Detecting the number of curves, the real initial and final points of each one and the data necessary to speed up the process of getting curve information as requested ( basically the funcionals )

Do you like the project?

Thanks