int
brep_edge_check(int reason,
const SubsurfaceBBNode* sbv,
const ON_BrepFace* face,
const ON_Surface* surf,
const ON_Ray& r,
HitList& hits)
{
// if the intersection was not found for any reason, we need to
// check and see if we are close to any topological edges; we may
// have hit a crack...
// the proper way to do this is to only look at edges
// interesecting with the subsurface bounding box... but for
// now, we'll look at the edges associated with the face for the bounding box...
// XXX - optimize this
set<ON_BrepEdge*> edges;
ON_3dPoint pt;
for (int i = 0; i < face->LoopCount(); i++) {
ON_BrepLoop* loop = face->Loop(i);
for (int j = 0; j < loop->TrimCount(); j++) {
ON_BrepTrim* trim = loop->Trim(j);
ON_BrepEdge* edge = trim->Edge();
pair<set<ON_BrepEdge*>::iterator, bool> res = edges.insert(edge);
// if (res.second) {
// only check if its the first time we've seen this
// edge
const ON_Curve* curve = edge->EdgeCurveOf();
Sample s;
if (curve->CloseTo(ON_3dPoint(hits.back().point), BREP_EDGE_MISS_TOLERANCE, s)) {
TRACE1("CLOSE TO EDGE");
hits.back().closeToEdge = true;
return BREP_INTERSECT_FOUND;
}
}
}
return BREP_INTERSECT_TRIMMED;
}
osg::Node* RhinoReader::BuildShadedFace(const ON_BrepFace* theFace)
{
osg::ref_ptr<osg::Geode> aGeode = new osg::Geode();
ON_NurbsSurface aSurface;
if (theFace->GetNurbForm(aSurface) == 0)
{
return NULL;
}
osg::ref_ptr<osg::Geometry> aGeometry = new osg::Geometry();
osg::ref_ptr<osg::Vec3Array> aUVPoints = new osg::Vec3Array();
osg::ref_ptr<osg::Vec3Array> aPoints = new osg::Vec3Array();
osg::ref_ptr<osg::Vec3Array> aBounds = new osg::Vec3Array();
osg::ref_ptr<osgUtil::DelaunayTriangulator> dt = new osgUtil::DelaunayTriangulator();
osg::ref_ptr<osgUtil::DelaunayConstraint> dc = new osgUtil::DelaunayConstraint();
// add loop for the face.
for (int i = 0; i < theFace->LoopCount(); ++i)
{
ON_BrepLoop* aLoop = theFace->Loop(i);
if (aLoop->m_type == ON_BrepLoop::outer)
{
for (int j = 0; j < aLoop->TrimCount(); ++j)
{
ON_BrepTrim* aTrim = aLoop->Trim(j);
const ON_Curve* aPCurve = aTrim->TrimCurveOf();
if (aPCurve)
{
ON_3dPoint aStartPoint = aPCurve->PointAtStart();
ON_3dPoint aEndPoint = aPCurve->PointAtEnd();
aUVPoints->push_back(osg::Vec3(aStartPoint.x, aStartPoint.y, 0.0));
aUVPoints->push_back(osg::Vec3(aEndPoint.x, aEndPoint.y, 0.0));
}
}
}
else if (aLoop->m_type == ON_BrepLoop::inner)
{
for (int j = 0; j < aLoop->TrimCount(); ++j)
{
}
}
}
dc->setVertexArray(aBounds);
dc->addPrimitiveSet(new osg::DrawArrays(osg::PrimitiveSet::LINE_LOOP, 0, aBounds->size()));
// triangulate the parametric space.
//dt->addInputConstraint(dc);
dt->setInputPointArray(aUVPoints);
dt->triangulate();
//dt->removeInternalTriangles(dc);
for (osg::Vec3Array::const_iterator j = aUVPoints->begin(); j != aUVPoints->end(); ++j)
{
// evaluate the point on the surface
ON_3dPoint aPoint = aSurface.PointAt((*j).x(), (*j).y());
aPoints->push_back(osg::Vec3(aPoint.x, aPoint.y, aPoint.z));
}
//aGeometry->setVertexArray(aUVPoints);
aGeometry->setVertexArray(aPoints);
aGeometry->addPrimitiveSet(dt->getTriangles());
aGeode->addDrawable(aGeometry);
// use smoothing visitor to set the average normals
//osgUtil::SmoothingVisitor sv;
//sv.apply(*aGeode);
return aGeode.release();
}
