mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-08-30 14:58:49 +08:00
Modeling - New BRrep Graph representation (#1166)
Implement new representation of topology and BRep into OCCT. New foundation represent 2 levels: BRepGraph - public interfaces which making the topology graph representation BRepGraphInc - internal structure which represent topology as an incident tables. The foundation provides basic logic for conversion from TopoDS_Shape to BRepGraph and back. The foundation provides the iteration and exploring interfaces to travel in both directions on any level of topology. The internal id type of inc tables is 'int', which is not for long term and can be updated, better to use typed id aliases, even for the iterations, they provide all necessary operators. The access to the BRepGraph is done using multiple View classes available by methods from main class. The extensions on graphs is possible with 'Layer' and 'Cache', where first is persistent, second - temporary, Some basic operations on graph also provided for compact, analyze and copy.
This commit is contained in:
Pasukhin Dmitry
@@ -0,0 +1,278 @@
|
||||
// Copyright (c) 2026 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 <BRepGraph_ShapesView.hxx>
|
||||
#include <BRepGraph_Data.hxx>
|
||||
#include <BRepGraph_ParamLayer.hxx>
|
||||
#include <BRepGraph_RefsIterator.hxx>
|
||||
#include <BRepGraph_RegularityLayer.hxx>
|
||||
#include <BRepGraphInc_Reconstruct.hxx>
|
||||
|
||||
#include <BRep_Builder.hxx>
|
||||
#include <NCollection_Map.hxx>
|
||||
#include <Standard_ProgramError.hxx>
|
||||
#include <TopoDS_Compound.hxx>
|
||||
|
||||
#include <shared_mutex>
|
||||
|
||||
namespace
|
||||
{
|
||||
struct BRepGraph_ReconstructionContext
|
||||
{
|
||||
const BRepGraph* Graph = nullptr;
|
||||
const BRepGraphInc_Storage* Storage = nullptr;
|
||||
const BRepGraph_ParamLayer* Params = nullptr;
|
||||
const BRepGraph_RegularityLayer* Regularities = nullptr;
|
||||
BRepGraphInc_Reconstruct::Cache Cache;
|
||||
NCollection_Map<int> ActiveProducts;
|
||||
};
|
||||
|
||||
static TopoDS_Shape reconstructProductLocal(BRepGraph_ReconstructionContext& theContext,
|
||||
const BRepGraph_ProductId theProduct);
|
||||
|
||||
static TopoDS_Shape reconstructOccurrenceLocal(BRepGraph_ReconstructionContext& theContext,
|
||||
const BRepGraph_OccurrenceId theOccurrence)
|
||||
{
|
||||
const BRepGraphInc_Storage& aStorage = *theContext.Storage;
|
||||
if (!theOccurrence.IsValid(aStorage.NbOccurrences()))
|
||||
return TopoDS_Shape();
|
||||
|
||||
const BRepGraphInc::OccurrenceDef& anOccurrence = aStorage.Occurrence(theOccurrence);
|
||||
if (anOccurrence.IsRemoved || !anOccurrence.ProductDefId.IsValid(aStorage.NbProducts()))
|
||||
return TopoDS_Shape();
|
||||
|
||||
TopoDS_Shape aShape = reconstructProductLocal(theContext, anOccurrence.ProductDefId);
|
||||
if (!aShape.IsNull() && !anOccurrence.Placement.IsIdentity())
|
||||
aShape.Move(anOccurrence.Placement);
|
||||
return aShape;
|
||||
}
|
||||
|
||||
static TopoDS_Shape reconstructProductLocal(BRepGraph_ReconstructionContext& theContext,
|
||||
const BRepGraph_ProductId theProduct)
|
||||
{
|
||||
const BRepGraphInc_Storage& aStorage = *theContext.Storage;
|
||||
if (!theProduct.IsValid(aStorage.NbProducts()))
|
||||
return TopoDS_Shape();
|
||||
|
||||
const BRepGraph_NodeId aProductNode = BRepGraph_ProductId(theProduct.Index);
|
||||
if (const TopoDS_Shape* aCached = theContext.Cache.Seek(aProductNode))
|
||||
return *aCached;
|
||||
|
||||
const BRepGraphInc::ProductDef& aProduct = aStorage.Product(theProduct);
|
||||
if (aProduct.IsRemoved || theContext.ActiveProducts.Contains(theProduct.Index))
|
||||
return TopoDS_Shape();
|
||||
|
||||
theContext.ActiveProducts.Add(theProduct.Index);
|
||||
|
||||
TopoDS_Shape aResult;
|
||||
if (aProduct.ShapeRootId.IsValid())
|
||||
{
|
||||
aResult = BRepGraphInc_Reconstruct::Node(aStorage,
|
||||
aProduct.ShapeRootId,
|
||||
theContext.Cache,
|
||||
theContext.Params,
|
||||
theContext.Regularities);
|
||||
if (!aResult.IsNull())
|
||||
{
|
||||
if (aProduct.RootOrientation != TopAbs_FORWARD)
|
||||
aResult.Compose(aProduct.RootOrientation);
|
||||
if (!aProduct.RootLocation.IsIdentity())
|
||||
aResult.Move(aProduct.RootLocation);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
BRep_Builder aBuilder;
|
||||
TopoDS_Compound aCompound;
|
||||
aBuilder.MakeCompound(aCompound);
|
||||
|
||||
for (BRepGraph_RefsOccurrenceOfProduct anOccIt(*theContext.Graph, theProduct); anOccIt.More();
|
||||
anOccIt.Next())
|
||||
{
|
||||
const BRepGraphInc::OccurrenceRef& anOccurrenceRef =
|
||||
aStorage.OccurrenceRef(anOccIt.CurrentId());
|
||||
|
||||
TopoDS_Shape aChild = reconstructOccurrenceLocal(theContext, anOccurrenceRef.OccurrenceDefId);
|
||||
if (!aChild.IsNull())
|
||||
aBuilder.Add(aCompound, aChild);
|
||||
}
|
||||
|
||||
aResult = aCompound;
|
||||
}
|
||||
|
||||
theContext.ActiveProducts.Remove(theProduct.Index);
|
||||
if (!aResult.IsNull())
|
||||
theContext.Cache.Bind(aProductNode, aResult);
|
||||
return aResult;
|
||||
}
|
||||
|
||||
static TopoDS_Shape reconstructShape(BRepGraph_ReconstructionContext& theContext,
|
||||
const BRepGraph_NodeId theNode)
|
||||
{
|
||||
if (!theNode.IsValid())
|
||||
return TopoDS_Shape();
|
||||
|
||||
const BRepGraphInc_Storage& aStorage = *theContext.Storage;
|
||||
switch (theNode.NodeKind)
|
||||
{
|
||||
case BRepGraph_NodeId::Kind::Product:
|
||||
return reconstructProductLocal(theContext, BRepGraph_ProductId(theNode.Index));
|
||||
case BRepGraph_NodeId::Kind::Occurrence: {
|
||||
const BRepGraph_OccurrenceId anOccurrence(theNode.Index);
|
||||
if (!anOccurrence.IsValid(aStorage.NbOccurrences()))
|
||||
return TopoDS_Shape();
|
||||
|
||||
const BRepGraphInc::OccurrenceDef& anOccurrenceDef = aStorage.Occurrence(anOccurrence);
|
||||
if (anOccurrenceDef.IsRemoved || !anOccurrenceDef.ProductDefId.IsValid(aStorage.NbProducts()))
|
||||
return TopoDS_Shape();
|
||||
|
||||
TopoDS_Shape aShape = reconstructProductLocal(theContext, anOccurrenceDef.ProductDefId);
|
||||
if (!aShape.IsNull())
|
||||
{
|
||||
const TopLoc_Location aGlobalLocation =
|
||||
theContext.Graph->Topo().Occurrences().OccurrenceLocation(anOccurrence);
|
||||
if (!aGlobalLocation.IsIdentity())
|
||||
aShape.Move(aGlobalLocation);
|
||||
}
|
||||
return aShape;
|
||||
}
|
||||
default:
|
||||
return BRepGraphInc_Reconstruct::Node(aStorage,
|
||||
theNode,
|
||||
theContext.Cache,
|
||||
theContext.Params,
|
||||
theContext.Regularities);
|
||||
}
|
||||
}
|
||||
|
||||
static BRepGraph_ReconstructionContext makeReconstructionContext(
|
||||
const BRepGraph* theGraph,
|
||||
const BRepGraphInc_Storage& theStorage)
|
||||
{
|
||||
BRepGraph_ReconstructionContext aContext;
|
||||
aContext.Graph = theGraph;
|
||||
aContext.Storage = &theStorage;
|
||||
|
||||
const occ::handle<BRepGraph_ParamLayer> aParamLayer =
|
||||
theGraph->LayerRegistry().FindLayer<BRepGraph_ParamLayer>();
|
||||
const occ::handle<BRepGraph_RegularityLayer> aRegularityLayer =
|
||||
theGraph->LayerRegistry().FindLayer<BRepGraph_RegularityLayer>();
|
||||
aContext.Params = aParamLayer.get();
|
||||
aContext.Regularities = aRegularityLayer.get();
|
||||
return aContext;
|
||||
}
|
||||
} // namespace
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
TopoDS_Shape BRepGraph::ShapesView::Shape(const BRepGraph_NodeId theNode) const
|
||||
{
|
||||
if (!theNode.IsValid())
|
||||
return TopoDS_Shape();
|
||||
|
||||
// Fast path: if entity was never mutated, return the original shape.
|
||||
const BRepGraphInc::BaseDef* aDef = myGraph->topoEntity(theNode);
|
||||
if (aDef != nullptr && aDef->SubtreeGen == 0)
|
||||
{
|
||||
const TopoDS_Shape* anOrig = myGraph->myData->myIncStorage.FindOriginal(theNode);
|
||||
if (anOrig != nullptr)
|
||||
return *anOrig;
|
||||
}
|
||||
|
||||
// Check mutable cache under shared lock with SubtreeGen validation.
|
||||
{
|
||||
std::shared_lock<std::shared_mutex> aReadLock(myGraph->myData->myCurrentShapesMutex);
|
||||
const BRepGraph_Data::CachedShape* aCached = myGraph->myData->myCurrentShapes.Seek(theNode);
|
||||
if (aCached != nullptr && aDef != nullptr && aCached->StoredSubtreeGen == aDef->SubtreeGen)
|
||||
return aCached->Shape;
|
||||
}
|
||||
|
||||
// Reconstruct from incidence storage / assembly facade.
|
||||
BRepGraph_ReconstructionContext aContext =
|
||||
makeReconstructionContext(myGraph, myGraph->myData->myIncStorage);
|
||||
TopoDS_Shape aReconstructed = reconstructShape(aContext, theNode);
|
||||
|
||||
// Store under exclusive lock with double-check to avoid redundant writes
|
||||
// when multiple threads reconstruct the same parent node concurrently.
|
||||
if (!aReconstructed.IsNull() && aDef != nullptr)
|
||||
{
|
||||
std::unique_lock<std::shared_mutex> aWriteLock(myGraph->myData->myCurrentShapesMutex);
|
||||
const BRepGraph_Data::CachedShape* aExisting = myGraph->myData->myCurrentShapes.Seek(theNode);
|
||||
if (aExisting != nullptr && aExisting->StoredSubtreeGen == aDef->SubtreeGen)
|
||||
{
|
||||
return aExisting->Shape;
|
||||
}
|
||||
BRepGraph_Data::CachedShape anEntry;
|
||||
anEntry.Shape = aReconstructed;
|
||||
anEntry.StoredSubtreeGen = aDef->SubtreeGen;
|
||||
myGraph->myData->myCurrentShapes.Bind(theNode, anEntry);
|
||||
if (theNode.NodeKind != BRepGraph_NodeId::Kind::Product
|
||||
&& theNode.NodeKind != BRepGraph_NodeId::Kind::Occurrence)
|
||||
{
|
||||
myGraph->myData->myIncStorage.BindTShapeToNode(aReconstructed.TShape().get(), theNode);
|
||||
}
|
||||
}
|
||||
return aReconstructed;
|
||||
}
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
bool BRepGraph::ShapesView::HasOriginal(const BRepGraph_NodeId theNode) const
|
||||
{
|
||||
return myGraph->myData->myIncStorage.HasOriginal(theNode);
|
||||
}
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
const TopoDS_Shape& BRepGraph::ShapesView::OriginalOf(const BRepGraph_NodeId theNode) const
|
||||
{
|
||||
const TopoDS_Shape* aShape = myGraph->myData->myIncStorage.FindOriginal(theNode);
|
||||
if (aShape == nullptr)
|
||||
throw Standard_ProgramError("BRepGraph::ShapesView::OriginalOf() - no original shape.");
|
||||
return *aShape;
|
||||
}
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
TopoDS_Shape BRepGraph::ShapesView::Reconstruct(const BRepGraph_NodeId theRoot) const
|
||||
{
|
||||
BRepGraph_ReconstructionContext aContext =
|
||||
makeReconstructionContext(myGraph, myGraph->myData->myIncStorage);
|
||||
return reconstructShape(aContext, theRoot);
|
||||
}
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
BRepGraph_NodeId BRepGraph::ShapesView::FindNode(const TopoDS_Shape& theShape) const
|
||||
{
|
||||
if (theShape.IsNull())
|
||||
return BRepGraph_NodeId();
|
||||
|
||||
const BRepGraph_NodeId* aNodeId =
|
||||
myGraph->myData->myIncStorage.FindNodeByTShape(theShape.TShape().get());
|
||||
if (aNodeId != nullptr)
|
||||
return *aNodeId;
|
||||
return BRepGraph_NodeId();
|
||||
}
|
||||
|
||||
//=================================================================================================
|
||||
|
||||
bool BRepGraph::ShapesView::HasNode(const TopoDS_Shape& theShape) const
|
||||
{
|
||||
if (theShape.IsNull())
|
||||
return false;
|
||||
|
||||
return myGraph->myData->myIncStorage.HasTShapeBinding(theShape.TShape().get());
|
||||
}
|
||||
Reference in New Issue
Block a user