mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-10 18:51:21 +03:00
159 lines
5.5 KiB
C++
159 lines
5.5 KiB
C++
// Created on: 1995-09-19
|
|
// Created by: Laurent PAINNOT
|
|
// Copyright (c) 1995-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 <StdPrs_HLRPolyShape.ixx>
|
|
|
|
#include <StdPrs_WFShape.hxx>
|
|
#include <TopAbs.hxx>
|
|
#include <TopExp_Explorer.hxx>
|
|
#include <Graphic3d_Group.hxx>
|
|
#include <Graphic3d_ArrayOfPolylines.hxx>
|
|
#include <Prs3d_LineAspect.hxx>
|
|
#include <BRepMesh_IncrementalMesh.hxx>
|
|
#include <HLRBRep_PolyAlgo.hxx>
|
|
#include <HLRBRep_ListOfBPoint.hxx>
|
|
#include <HLRBRep_BiPoint.hxx>
|
|
#include <HLRAlgo_EdgeStatus.hxx>
|
|
#include <HLRAlgo_EdgeIterator.hxx>
|
|
#include <HLRBRep_ListIteratorOfListOfBPoint.hxx>
|
|
#include <TColgp_SequenceOfPnt.hxx>
|
|
|
|
#define PntX1 ((Standard_Real*)Coordinates)[0]
|
|
#define PntY1 ((Standard_Real*)Coordinates)[1]
|
|
#define PntZ1 ((Standard_Real*)Coordinates)[2]
|
|
#define PntX2 ((Standard_Real*)Coordinates)[3]
|
|
#define PntY2 ((Standard_Real*)Coordinates)[4]
|
|
#define PntZ2 ((Standard_Real*)Coordinates)[5]
|
|
|
|
//=======================================================================
|
|
//function : Add
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
void StdPrs_HLRPolyShape::Add(const Handle (Prs3d_Presentation)& aPresentation,
|
|
const TopoDS_Shape& aShape,
|
|
const Handle (Prs3d_Drawer)& aDrawer,
|
|
const Handle (Prs3d_Projector)& aProjector)
|
|
{
|
|
Handle(Graphic3d_Group) aGroup = Prs3d_Root::CurrentGroup(aPresentation);
|
|
|
|
TopExp_Explorer ex;
|
|
|
|
// find vertices not under ancestors.
|
|
TopAbs_ShapeEnum E = aShape.ShapeType();
|
|
if (E == TopAbs_COMPOUND) {
|
|
// it is necessary to present isolated vertexes instead of hiding them.
|
|
for (ex.Init(aShape, TopAbs_VERTEX, TopAbs_EDGE); ex.More(); ex.Next()) {
|
|
StdPrs_WFShape::Add(aPresentation, ex.Current(), aDrawer);
|
|
}
|
|
}
|
|
|
|
TColgp_SequenceOfPnt HiddenPnts;
|
|
TColgp_SequenceOfPnt SeenPnts;
|
|
|
|
const Standard_Boolean rel = aDrawer->TypeOfDeflection() == Aspect_TOD_RELATIVE;
|
|
Standard_Real def = rel? aDrawer->HLRDeviationCoefficient() : aDrawer->MaximalChordialDeviation();
|
|
BRepMesh_IncrementalMesh mesh(aShape, def, rel, aDrawer->HLRAngle());
|
|
|
|
Handle(HLRBRep_PolyAlgo) hider = new HLRBRep_PolyAlgo(aShape);
|
|
|
|
hider->Projector(aProjector->Projector());
|
|
hider->Angle(aDrawer->HLRAngle());
|
|
hider->Update();
|
|
Standard_Real sta,end,dx,dy,dz;
|
|
Standard_ShortReal tolsta, tolend;
|
|
HLRAlgo_EdgeStatus status;
|
|
HLRAlgo_EdgeIterator It;
|
|
Standard_Boolean reg1,regn,outl, intl;
|
|
Standard_Address Coordinates;
|
|
TopoDS_Shape S;
|
|
|
|
HLRBRep_ListOfBPoint BiPntVis, BiPntHid;
|
|
|
|
for (hider->InitHide(); hider->MoreHide(); hider->NextHide())
|
|
{
|
|
hider->Hide(Coordinates, status, S, reg1, regn, outl, intl);
|
|
|
|
dx = PntX2 - PntX1;
|
|
dy = PntY2 - PntY1;
|
|
dz = PntZ2 - PntZ1;
|
|
|
|
for (It.InitVisible(status); It.MoreVisible(); It.NextVisible())
|
|
{
|
|
It.Visible(sta,tolsta,end,tolend);
|
|
BiPntVis.Append
|
|
(HLRBRep_BiPoint
|
|
(PntX1 + sta * dx,PntY1 + sta * dy,PntZ1 + sta * dz,
|
|
PntX1 + end * dx,PntY1 + end * dy,PntZ1 + end * dz,
|
|
S,reg1,regn,outl,intl));
|
|
}
|
|
|
|
for (It.InitHidden(status); It.MoreHidden(); It.NextHidden())
|
|
{
|
|
It.Hidden(sta,tolsta,end,tolend);
|
|
BiPntHid.Append
|
|
(HLRBRep_BiPoint
|
|
(PntX1 + sta * dx,PntY1 + sta * dy,PntZ1 + sta * dz,
|
|
PntX1 + end * dx,PntY1 + end * dy,PntZ1 + end * dz,
|
|
S,reg1,regn,outl,intl));
|
|
}
|
|
}
|
|
|
|
// storage in the group:
|
|
HLRBRep_ListIteratorOfListOfBPoint ItB;
|
|
|
|
if (aDrawer->DrawHiddenLine()) {
|
|
for (ItB.Initialize(BiPntHid); ItB.More(); ItB.Next()) {
|
|
const HLRBRep_BiPoint& BP = ItB.Value();
|
|
if (!BP.RgNLine() || BP.OutLine()) {
|
|
HiddenPnts.Append(BP.P1());
|
|
HiddenPnts.Append(BP.P2());
|
|
}
|
|
}
|
|
}
|
|
|
|
for (ItB.Initialize(BiPntVis); ItB.More(); ItB.Next()) {
|
|
const HLRBRep_BiPoint& BP = ItB.Value();
|
|
if (!BP.RgNLine() || BP.OutLine()) {
|
|
SeenPnts.Append(BP.P1());
|
|
SeenPnts.Append(BP.P2());
|
|
}
|
|
}
|
|
|
|
Standard_Integer nbVertices = HiddenPnts.Length();
|
|
if(nbVertices > 0) {
|
|
Handle(Graphic3d_ArrayOfPolylines) HiddenArray = new Graphic3d_ArrayOfPolylines(nbVertices, (Standard_Integer)nbVertices/2);
|
|
for(int i=1; i<=nbVertices; i+=2) {
|
|
HiddenArray->AddBound(2);
|
|
HiddenArray->AddVertex(HiddenPnts.Value(i));
|
|
HiddenArray->AddVertex(HiddenPnts.Value(i+1));
|
|
}
|
|
aGroup->SetPrimitivesAspect(aDrawer->HiddenLineAspect()->Aspect());
|
|
aGroup->AddPrimitiveArray(HiddenArray);
|
|
}
|
|
nbVertices = SeenPnts.Length();
|
|
if(nbVertices > 0) {
|
|
Handle(Graphic3d_ArrayOfPolylines) SeenArray = new Graphic3d_ArrayOfPolylines(nbVertices, (Standard_Integer)nbVertices/2);
|
|
for(int i=1; i<=nbVertices; i+=2) {
|
|
SeenArray->AddBound(2);
|
|
SeenArray->AddVertex(SeenPnts.Value(i));
|
|
SeenArray->AddVertex(SeenPnts.Value(i+1));
|
|
}
|
|
aGroup->SetPrimitivesAspect(aDrawer->SeenLineAspect()->Aspect());
|
|
aGroup->AddPrimitiveArray(SeenArray);
|
|
}
|
|
}
|