187 lines
8.2 KiB
C++
187 lines
8.2 KiB
C++
/***************************************************************************
|
|
* Copyright (c) 2007 Werner Mayer <wmayer[at]users.sourceforge.net> *
|
|
* *
|
|
* This file is part of the FreeCAD CAx development system. *
|
|
* *
|
|
* This library is free software; you can redistribute it and/or *
|
|
* modify it under the terms of the GNU Library General Public *
|
|
* License as published by the Free Software Foundation; either *
|
|
* version 2 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 Library General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU Library General Public *
|
|
* License along with this library; see the file COPYING.LIB. If not, *
|
|
* write to the Free Software Foundation, Inc., 59 Temple Place, *
|
|
* Suite 330, Boston, MA 02111-1307, USA *
|
|
* *
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
#include "PreCompiled.h"
|
|
#ifndef _PreComp_
|
|
# include <BRepAlgoAPI_Common.hxx>
|
|
# include <BRepCheck_Analyzer.hxx>
|
|
# include <Standard_Failure.hxx>
|
|
# include <TopoDS_Iterator.hxx>
|
|
# include <TopTools_IndexedMapOfShape.hxx>
|
|
# include <TopExp.hxx>
|
|
#endif
|
|
|
|
|
|
#include "FeaturePartCommon.h"
|
|
#include "modelRefine.h"
|
|
#include <App/Application.h>
|
|
#include <Base/Parameter.h>
|
|
#include <Base/Exception.h>
|
|
|
|
using namespace Part;
|
|
|
|
PROPERTY_SOURCE(Part::Common, Part::Boolean)
|
|
|
|
|
|
Common::Common(void)
|
|
{
|
|
}
|
|
|
|
BRepAlgoAPI_BooleanOperation* Common::makeOperation(const TopoDS_Shape& base, const TopoDS_Shape& tool) const
|
|
{
|
|
// Let's call algorithm computing a section operation:
|
|
return new BRepAlgoAPI_Common(base, tool);
|
|
}
|
|
|
|
// ----------------------------------------------------
|
|
|
|
PROPERTY_SOURCE(Part::MultiCommon, Part::Feature)
|
|
|
|
|
|
MultiCommon::MultiCommon(void)
|
|
{
|
|
ADD_PROPERTY(Shapes,(0));
|
|
Shapes.setSize(0);
|
|
ADD_PROPERTY_TYPE(History,(ShapeHistory()), "Boolean", (App::PropertyType)
|
|
(App::Prop_Output|App::Prop_Transient|App::Prop_Hidden), "Shape history");
|
|
History.setSize(0);
|
|
}
|
|
|
|
short MultiCommon::mustExecute() const
|
|
{
|
|
if (Shapes.isTouched())
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
App::DocumentObjectExecReturn *MultiCommon::execute(void)
|
|
{
|
|
std::vector<TopoDS_Shape> s;
|
|
std::vector<App::DocumentObject*> obj = Shapes.getValues();
|
|
|
|
std::vector<App::DocumentObject*>::iterator it;
|
|
for (it = obj.begin(); it != obj.end(); ++it) {
|
|
if ((*it)->getTypeId().isDerivedFrom(Part::Feature::getClassTypeId())) {
|
|
s.push_back(static_cast<Part::Feature*>(*it)->Shape.getValue());
|
|
}
|
|
}
|
|
|
|
bool argumentsAreInCompound = false;
|
|
TopoDS_Shape compoundOfArguments;
|
|
|
|
//if only one source shape, and it is a compound - fuse children of the compound
|
|
if (s.size() == 1){
|
|
compoundOfArguments = s[0];
|
|
if (compoundOfArguments.ShapeType() == TopAbs_COMPOUND){
|
|
s.clear();
|
|
TopoDS_Iterator it(compoundOfArguments);
|
|
for (; it.More(); it.Next()) {
|
|
const TopoDS_Shape& aChild = it.Value();
|
|
s.push_back(aChild);
|
|
}
|
|
argumentsAreInCompound = true;
|
|
}
|
|
}
|
|
|
|
if (s.size() >= 2) {
|
|
try {
|
|
std::vector<ShapeHistory> history;
|
|
TopoDS_Shape resShape = s.front();
|
|
for (std::vector<TopoDS_Shape>::iterator it = s.begin()+1; it != s.end(); ++it) {
|
|
// Let's call algorithm computing a fuse operation:
|
|
BRepAlgoAPI_Common mkCommon(resShape, *it);
|
|
// Let's check if the fusion has been successful
|
|
if (!mkCommon.IsDone())
|
|
throw Base::Exception("Intersection failed");
|
|
resShape = mkCommon.Shape();
|
|
|
|
ShapeHistory hist1 = buildHistory(mkCommon, TopAbs_FACE, resShape, mkCommon.Shape1());
|
|
ShapeHistory hist2 = buildHistory(mkCommon, TopAbs_FACE, resShape, mkCommon.Shape2());
|
|
if (history.empty()) {
|
|
history.push_back(hist1);
|
|
history.push_back(hist2);
|
|
}
|
|
else {
|
|
for (std::vector<ShapeHistory>::iterator jt = history.begin(); jt != history.end(); ++jt)
|
|
*jt = joinHistory(*jt, hist1);
|
|
history.push_back(hist2);
|
|
}
|
|
}
|
|
if (resShape.IsNull())
|
|
throw Base::Exception("Resulting shape is invalid");
|
|
|
|
Base::Reference<ParameterGrp> hGrp = App::GetApplication().GetUserParameter()
|
|
.GetGroup("BaseApp")->GetGroup("Preferences")->GetGroup("Mod/Part/Boolean");
|
|
if (hGrp->GetBool("CheckModel", false)) {
|
|
BRepCheck_Analyzer aChecker(resShape);
|
|
if (! aChecker.IsValid() ) {
|
|
return new App::DocumentObjectExecReturn("Resulting shape is invalid");
|
|
}
|
|
}
|
|
if (hGrp->GetBool("RefineModel", false)) {
|
|
TopoDS_Shape oldShape = resShape;
|
|
BRepBuilderAPI_RefineModel mkRefine(oldShape);
|
|
resShape = mkRefine.Shape();
|
|
ShapeHistory hist = buildHistory(mkRefine, TopAbs_FACE, resShape, oldShape);
|
|
for (std::vector<ShapeHistory>::iterator jt = history.begin(); jt != history.end(); ++jt)
|
|
*jt = joinHistory(*jt, hist);
|
|
}
|
|
|
|
this->Shape.setValue(resShape);
|
|
|
|
if (argumentsAreInCompound){
|
|
//combine histories of every child of source compound into one
|
|
ShapeHistory overallHist;
|
|
TopTools_IndexedMapOfShape facesOfCompound;
|
|
TopAbs_ShapeEnum type = TopAbs_FACE;
|
|
TopExp::MapShapes(compoundOfArguments, type, facesOfCompound);
|
|
for (std::size_t iChild = 0; iChild < history.size(); iChild++){ //loop over children of source compound
|
|
//for each face of a child, find the inex of the face in compound, and assign the corresponding right-hand-size of the history
|
|
TopTools_IndexedMapOfShape facesOfChild;
|
|
TopExp::MapShapes(s[iChild], type, facesOfChild);
|
|
for(std::pair<const int,ShapeHistory::List> &histitem: history[iChild].shapeMap){ //loop over elements of history - that is - over faces of the child of source compound
|
|
int iFaceInChild = histitem.first;
|
|
ShapeHistory::List &iFacesInResult = histitem.second;
|
|
TopoDS_Shape srcFace = facesOfChild(iFaceInChild + 1); //+1 to convert our 0-based to OCC 1-bsed conventions
|
|
int iFaceInCompound = facesOfCompound.FindIndex(srcFace)-1;
|
|
overallHist.shapeMap[iFaceInCompound] = iFacesInResult; //this may overwrite existing info if the same face is used in several children of compound. This shouldn't be a problem, because the histories should match anyway...
|
|
}
|
|
}
|
|
history.clear();
|
|
history.push_back(overallHist);
|
|
}
|
|
this->History.setValues(history);
|
|
}
|
|
catch (Standard_Failure) {
|
|
Handle_Standard_Failure e = Standard_Failure::Caught();
|
|
return new App::DocumentObjectExecReturn(e->GetMessageString());
|
|
}
|
|
}
|
|
else {
|
|
throw Base::Exception("Not enough shape objects linked");
|
|
}
|
|
|
|
return App::DocumentObject::StdReturn;
|
|
}
|