Anonymous | Login | 2021-01-23 04:37 MSK | ![]() |
My View | View Issues | Change Log | Roadmap |
View Revisions: Issue #29104 | [ All Revisions ] [ Back to Issue ] | ||
Summary | 0029104: Modeling Algorithms - Reject use of starting point in Prm-Prm intersection algorithm | ||
Revision | 2017-11-17 09:44 by nbv | ||
Description | Now, if starting points are given then the algorithm makes additional work in order to build Walking-line using these points. After that, the intersector without starting points is executed. Indeed, the intersector w/o starting points must find (with some tolerance criterion) the line, which returns the intersector with start point. P.S. See the message 0029103:0070500. Moreover, test "boolean bsection P4" raises exception. |
||
Revision | 2017-09-14 15:37 by nbv | ||
Description | Now, if starting points are given then the algorithm makes additional work in order to build Walking-line using these points. After that, the intersector without starting points is executed. Indeed, the intersector w/o starting points must find (with some tolerance criterion) the line, which returns the intersector with start point. P.S. See the message 0029103:0070500. |
||
Revision | 2017-09-13 13:39 by emv | ||
Description | The intersection of the faces fails with StdFail_NotDone exception. Changing the order of the faces or giving the starting points allows producing the valid section curve. The problem has been discovered as a regression in the test case boolean bsection P4 trying to disable computation of the starting points for Face/Face intersection in Boolean Operations. |
Copyright © 2000 - 2021 MantisBT Team |