1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-07 18:30:55 +03:00
occt/src/BRepLib/BRepLib_MakeWire_1.cxx
abv d5f74e42d6 0024624: Lost word in license statement in source files
License statement text corrected; compiler warnings caused by Bison 2.41 disabled for MSVC; a few other compiler warnings on 54-bit Windows eliminated by appropriate type cast
Wrong license statements corrected in several files.
Copyright and license statements added in XSD and GLSL files.
Copyright year updated in some files.
Obsolete documentation files removed from DrawResources.
2014-02-20 16:15:17 +04:00

243 lines
7.4 KiB
C++

// Created on: 1998-05-20
// Created by: Didier PIFFAULT
// Copyright (c) 1998-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#include <BRepLib_MakeWire.ixx>
#include <BRepLib.hxx>
#include <TopTools_MapOfShape.hxx>
#include <TopTools_MapOfOrientedShape.hxx>
#include <TopTools_MapIteratorOfMapOfShape.hxx>
#include <TopTools_MapIteratorOfMapOfOrientedShape.hxx>
#include <TopTools_DataMapOfShapeShape.hxx>
#include <TopTools_ListOfShape.hxx>
#include <TopTools_ListIteratorOfListOfShape.hxx>
#include <BRep_Builder.hxx>
#include <TopExp.hxx>
#include <TopExp_Explorer.hxx>
#include <TopoDS.hxx>
#include <TopoDS_Vertex.hxx>
#include <TopoDS_Edge.hxx>
#include <TopoDS_Compound.hxx>
#include <BRep_Tool.hxx>
#include <gp_Pnt.hxx>
#include <TopTools_IndexedDataMapOfShapeListOfShape.hxx>
//=======================================================================
//function : Add
//purpose : Add the list of edges to the current wire
//=======================================================================
void BRepLib_MakeWire::Add(const TopTools_ListOfShape& L)
{
myError = BRepLib_WireDone;
if (!myShape.IsNull()) myShape.Closed(Standard_False);
if (!L.IsEmpty()) {
NotDone();
TopTools_MapOfShape mapLocale;
mapLocale.Assign(myVertices);
TopTools_DataMapOfShapeShape toCopy;
TopTools_ListOfShape toAdd, nlist, rlist;
BRep_Builder BB;
TopExp_Explorer exv;
TopTools_MapIteratorOfMapOfShape itMS;
TopTools_ListIteratorOfListOfShape itList(L);
for (;itList.More(); itList.Next()) {
const TopoDS_Edge& curEd=TopoDS::Edge(itList.Value());
if (!curEd.IsNull()) {
rlist.Clear();
nlist.Clear();
Standard_Boolean copEd=Standard_False;
if (myEdge.IsNull()) {
Add(curEd);
if (!VF.IsNull()) mapLocale.Add(VF);
if (!VL.IsNull()) mapLocale.Add(VL);
NotDone();
continue;
}
for (exv.Init(curEd, TopAbs_VERTEX); exv.More(); exv.Next()) {
const TopoDS_Vertex& edVer=TopoDS::Vertex(exv.Current());
rlist.Prepend(edVer);
nlist.Prepend(edVer);
if (!mapLocale.Contains(edVer)) {
Standard_Boolean notYetFound = Standard_True;
Standard_Real gap=BRep_Tool::Tolerance(edVer);
gp_Pnt pVer=BRep_Tool::Pnt(edVer);
for (itMS.Initialize(mapLocale); itMS.More(); itMS.Next()) {
notYetFound=Standard_True;
const TopoDS_Vertex& refVer=TopoDS::Vertex(itMS.Key());
gap +=BRep_Tool::Tolerance(refVer);
if (pVer.Distance(BRep_Tool::Pnt(TopoDS::Vertex(refVer))) <= gap) {
nlist.RemoveFirst();
nlist.Prepend(refVer.Oriented(edVer.Orientation()));
copEd=Standard_True;
notYetFound=Standard_False;
break;
}
}
if (notYetFound) mapLocale.Add(edVer);
}
}
if (copEd) {
TopoDS_Shape aLocalShape = curEd.EmptyCopied();
TopoDS_Edge newEd=TopoDS::Edge(aLocalShape);
// TopoDS_Edge newEd=TopoDS::Edge(curEd.EmptyCopied());
BB.Transfert(curEd, newEd);
newEd.Closed(curEd.Closed());
TopTools_ListIteratorOfListOfShape itV(nlist);
for (; itV.More(); itV.Next()) {
BB.Add(newEd, itV.Value());
BB.Transfert(curEd, newEd, TopoDS::Vertex(rlist.First()), TopoDS::Vertex(itV.Value()));
rlist.RemoveFirst();
}
toAdd.Append(newEd);
}
else {
toAdd.Append(curEd);
}
}
}
if (!toAdd.IsEmpty()) {
TopoDS_Compound comp;
BB.MakeCompound(comp);
TopTools_MapIteratorOfMapOfOrientedShape itMOS;
TopTools_MapOfOrientedShape theEdges;
for (itList.Initialize(toAdd); itList.More(); itList.Next()) {
BB.Add(comp, itList.Value());
theEdges.Add(itList.Value());
}
TopTools_IndexedDataMapOfShapeListOfShape lesMeres;
TopExp::MapShapesAndAncestors(comp, TopAbs_VERTEX, TopAbs_EDGE, lesMeres);
TopoDS_Vertex vf, vl;
TopoDS_Shape theKey;
Standard_Boolean usedVertex;
Standard_Boolean closedEdge = Standard_False;
Standard_Integer vvInd, lastInd;
do {
if (!VL.IsNull() && lesMeres.Contains(VL)) {
if (!VF.IsNull()) closedEdge=VF.IsSame(VL);
usedVertex=Standard_True;
for (itList.Initialize(lesMeres.FindFromKey(VL)); itList.More(); itList.Next()) {
if (theEdges.Contains(itList.Value())) {
usedVertex=Standard_False;
theEdges.Remove(itList.Value());
TopExp::Vertices(TopoDS::Edge(itList.Value()), vf,vl);
if (vf.IsSame(VL)) {
BB.Add(myShape, itList.Value());
myVertices.Add(vl);
VL=vl;
}
else {
if (closedEdge) {
BB.Add(myShape, itList.Value());
VF=vf;
}
else {
BB.Add(myShape, itList.Value().Reversed());
vf.Reverse();
VL=vf;
}
myVertices.Add(vf);
}
}
}
if (usedVertex) {
lastInd=lesMeres.Extent();
vvInd=lesMeres.FindIndex(VL);
if (vvInd != lastInd) {
theKey=lesMeres.FindKey(lastInd);
nlist=lesMeres.FindFromIndex(lastInd);
}
lesMeres.RemoveLast();
if (vvInd != lastInd) {
lesMeres.Substitute(vvInd, theKey, nlist);
}
}
}
else if (!VF.IsNull() && lesMeres.Contains(VF)) {
usedVertex=Standard_True;
for (itList.Initialize(lesMeres.FindFromKey(VF)); itList.More(); itList.Next()) {
if (theEdges.Contains(itList.Value())) {
usedVertex=Standard_False;
theEdges.Remove(itList.Value());
TopExp::Vertices(TopoDS::Edge(itList.Value()), vf,vl);
if (vl.IsSame(VF)) {
BB.Add(myShape, itList.Value());
myVertices.Add(vf);
VF=vf;
}
else {
BB.Add(myShape, itList.Value().Reversed());
vl.Reverse();
myVertices.Add(vl);
VF=vl;
}
}
}
if (usedVertex) {
lastInd=lesMeres.Extent();
vvInd=lesMeres.FindIndex(VF);
if (vvInd != lastInd) {
theKey=lesMeres.FindKey(lastInd);
nlist=lesMeres.FindFromIndex(lastInd);
}
lesMeres.RemoveLast();
if (vvInd != lastInd) {
lesMeres.Substitute(vvInd, theKey, nlist);
}
}
}
else {
if (theEdges.Extent()>0) {
Standard_Boolean noCandidat=Standard_True;
for (itMOS.Initialize(theEdges); itMOS.More(); itMOS.Next()) {
TopExp::Vertices(TopoDS::Edge(itMOS.Key()), vf,vl);
if (myVertices.Contains(vl)) {
if (myError==BRepLib_WireDone) myError = BRepLib_NonManifoldWire;
BB.Add(myShape, itMOS.Key());
myVertices.Add(vf);
VF=vf;
noCandidat=Standard_False;
break;
}
else if (myVertices.Contains(vf)) {
if (myError==BRepLib_WireDone) myError = BRepLib_NonManifoldWire;
BB.Add(myShape, itMOS.Key());
myVertices.Add(vl);
VL=vl;
noCandidat=Standard_False;
break;
}
}
if (noCandidat) {
theEdges.Clear();
// Some Edges are not connected to first edge and the diagnosis is as follows
// but the "Maker" is Done() because otherwise it is not possible to return the constructed connected part...
myError=BRepLib_DisconnectedWire;
}
else theEdges.Remove(itMOS.Key());
}
}
} while (theEdges.Extent()>0);
}
}
if (!VF.IsNull() && !VL.IsNull() && VF.IsSame(VL))
myShape.Closed(Standard_True);
Done();
}