2014-01-09 14:20:44 +00:00
|
|
|
# -*- coding: utf-8 -*-
|
2021-03-23 17:44:27 +03:00
|
|
|
# Copyright (C) 2014-2021 EDF R&D
|
2019-02-14 14:55:47 +03:00
|
|
|
#
|
|
|
|
|
# This library is free software; you can redistribute it and/or
|
|
|
|
|
# modify it under the terms of the GNU Lesser General Public
|
|
|
|
|
# License as published by the Free Software Foundation; either
|
|
|
|
|
# version 2.1 of the License, or (at your option) any later version.
|
|
|
|
|
#
|
|
|
|
|
# This library is distributed in the hope that it will be useful,
|
|
|
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
|
# Lesser General Public License for more details.
|
|
|
|
|
#
|
|
|
|
|
# You should have received a copy of the GNU Lesser General Public
|
|
|
|
|
# License along with this library; if not, write to the Free Software
|
|
|
|
|
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
|
#
|
|
|
|
|
# See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
|
|
|
|
|
#
|
2014-01-09 14:20:44 +00:00
|
|
|
|
2017-03-20 13:27:30 +01:00
|
|
|
from .geomsmesh import geompy
|
2014-01-09 14:20:44 +00:00
|
|
|
import logging
|
|
|
|
|
import math
|
|
|
|
|
|
|
|
|
|
# -----------------------------------------------------------------------------
|
|
|
|
|
# --- projection d'un point sur une courbe.
|
|
|
|
|
|
|
|
|
|
def projettePointSurCourbe(pt, edge):
|
|
|
|
|
"""
|
|
|
|
|
projection d'un point p sur une courbe c
|
|
|
|
|
on suppose que la distance (c(u), p) passe par un minimum quand u varie entre 0 et 1
|
|
|
|
|
et qu'elle presente pas de minimum local
|
|
|
|
|
"""
|
|
|
|
|
#logging.debug("start")
|
|
|
|
|
|
|
|
|
|
dist = []
|
|
|
|
|
nbSlices = 50
|
|
|
|
|
du = 1.0/nbSlices
|
|
|
|
|
for i in range(nbSlices + 1):
|
|
|
|
|
p = geompy.MakeVertexOnCurve(edge, du*i)
|
|
|
|
|
d = geompy.MinDistance(p,pt)
|
|
|
|
|
dist.append((d,i))
|
|
|
|
|
dist.sort()
|
|
|
|
|
#logging.debug("dist %s", dist)
|
|
|
|
|
umin = du*dist[0][1]
|
|
|
|
|
umax = du*dist[1][1]
|
|
|
|
|
#umin = 0.0
|
|
|
|
|
#umax = 1.0
|
|
|
|
|
tol = 1.e-8
|
|
|
|
|
pmin = geompy.MakeVertexOnCurve(edge, umin)
|
|
|
|
|
pmax = geompy.MakeVertexOnCurve(edge, umax)
|
|
|
|
|
dmin = geompy.MinDistance(pmin,pt)
|
|
|
|
|
dmax = geompy.MinDistance(pmax,pt)
|
|
|
|
|
dext = geompy.MinDistance(pmin,pmax)
|
|
|
|
|
i=0
|
|
|
|
|
while dext > tol and i < 100 :
|
|
|
|
|
i = i+1
|
|
|
|
|
utest = (umax + umin) / 2.0
|
|
|
|
|
ptest = geompy.MakeVertexOnCurve(edge, utest)
|
|
|
|
|
dtest = geompy.MinDistance(ptest,pt)
|
|
|
|
|
if dmin < dmax:
|
|
|
|
|
umax = utest
|
|
|
|
|
pmax = ptest
|
|
|
|
|
dmax = dtest
|
|
|
|
|
else:
|
|
|
|
|
umin = utest
|
|
|
|
|
pmin = ptest
|
|
|
|
|
dmin = dtest
|
|
|
|
|
dext = geompy.MinDistance(pmin,pmax)
|
|
|
|
|
#logging.debug('umin=%s umax=%s dmin=%s dmax=%s dtest=%s dext=%s', umin,umax,dmin,dmax,dtest,dext)
|
|
|
|
|
if abs(utest) < 1.e-7:
|
|
|
|
|
utest = 0.0
|
|
|
|
|
if abs(1.0-utest) < 1.e-7:
|
|
|
|
|
utest = 1.0
|
|
|
|
|
logging.debug('u=%s, nbiter=%s dtest=%s dext=%s',utest,i,dtest,dext)
|
|
|
|
|
return utest
|
|
|
|
|
|
