View Issue Details
| ID | Project | Category | View Status | Date Submitted | Last Update |
|---|---|---|---|---|---|
| 0021446 | Open CASCADE | OCCT:Foundation Classes | public | 2009-10-29 15:56 | 2012-01-10 16:34 |
| Reporter | Assigned To | ||||
| Priority | normal | Severity | feature | ||
| Status | closed | Resolution | fixed | ||
| OS | All | ||||
| Fixed in Version | 6.4.0 | ||||
| Summary | 0021446: New algorithm to find minimal loops on a graph | ||||
| Description | The purpose of this improvement is to implement the generic algorithmic class that allows to find in a graph all minimal loops. | ||||
| Additional information and documentation updates | Documentation remark, added by MSV 2009-11-04 13:08:34: New features: Foundation classes. The new algorithmic class has been implemented. Its name is Poly_MakeLoops. It allows to find in a graph all minimal loops. A link in the graph is defined as a pair of node indices. The user defines a special callback class that provides the algorithm with all necessary geometric definitions. There are two descendants of the algorithm, one for working in 2D space, and another for working in 3D space on a surface, normal directions to which are defined at nodes. | ||||
| Tags | No tags attached. | ||||
| Test case number | |||||
| Date Modified | Username | Field | Change |
|---|---|---|---|
| 2009-11-03 12:37 |
|
CC | => szv |
| 2009-11-04 12:43 | bugmaster | Assigned To | bugmaster => msv |
| 2009-11-04 12:43 | bugmaster | Status | new => assigned |
| 2009-11-04 14:59 |
|
Status | assigned => resolved |
| 2010-06-23 13:32 | bugmaster | Status | resolved => tested |
| 2010-07-19 19:09 | bugmaster | Status | tested => verified |
| 2011-08-02 11:23 | bugmaster | Category | OCCT:FDC => OCCT:Foundation Classes |
| 2012-01-10 16:34 |
|
Description Updated | |
| 2012-01-10 16:34 |
|
Additional Information Updated |
