有人用CGAL吗？

highflyingbird · 发表于 2010-8-24 00:01:02

CGAL@www.cgal.org
安装/编译有点痛苦，但它有一些非常酷的东西。
我尝试了许多三角形算法之一，以下是仅计算三角形的结果
3.21761秒-213,093点
162.707秒-3,265,110点
计算三角形和绘制3d面
4.342942秒-213,093点
254.525742秒-3,265,110点

copy

  static void ArxPointCloud_tpc(void)
  {
    CalDelaunay dt;
    ads_name name = {0L,0L};
    ads_point point = {0.0,0.0,0.0};
    if(acedEntSel(_T("Select Point Cloud"),name,point) != RTNORM)
      return;
    LARGE_INTEGER freq,start,end;   
    QueryPerformanceFrequency(&freq);
    QueryPerformanceCounter(&start);
    // My Point cloud object
    AcDbObjectPointer pCloud( (AcDbObjectId)(AcDbStub*)name[0],AcDb::kForRead);
    if(pCloud.openStatus() != Acad::eOk)
      return;
    // inserting does the Delaunay!?!
    const AcGePoint3dArray &points = pCloud->PointArray();
    for (long i = 0; i workingDatabase(); 
    AcDbBlockTableRecordPointer pBlockTableRecord(pDB->currentSpaceId(),AcDb::kForWrite); 
    if(pBlockTableRecord.openStatus() != Acad::eOk)
      return;
    AcGePoint3d A,B,C;
    for (CalDelaunay::Finite_faces_iterator it = dt.finite_faces_begin();
                                             it!=dt.finite_faces_end();++it)
    {
      const CalPoint& pt0 =  (*it).vertex(0)->point();
      const CalPoint& pt1 =  (*it).vertex(1)->point();
      const CalPoint& pt2 =  (*it).vertex(2)->point();
      AcDbFace *pFace = new AcDbFace();
      if(pFace)
      {
        A.x = pt0.x(); A.y = pt0.y(); A.z = pt0.z();
        B.x = pt1.x(); B.y = pt1.y(); B.z = pt1.z();
        C.x = pt2.x(); C.y = pt2.y(); C.z = pt2.z();
        pFace->setVertexAt(0, A);
        pFace->setVertexAt(1, B);
        pFace->setVertexAt(2, C);
        pFace->setVertexAt(3, A);
        if(pBlockTableRecord->appendAcDbEntity(pFace) != Acad::eOk)
          delete pFace;
        else
          pFace->close();
      }
    }
    QueryPerformanceCounter(&end);
    acutPrintf(_T("\n%g seconds - %ld points"),
      (double)(end.QuadPart-start.QuadPart)/freq.QuadPart,points.length() );
  }

本帖以下内容被隐藏保护；需要你回复后，才能看到！

游客，如果您要查看本帖隐藏内容请回复

highflyingbird · 发表于 2010-8-24 01:16:06

太棒了！
很长一段时间以来，我一直想知道使用CGAL。
关于Delaunay，我也为autocad 2004-2006做了一个例程。
这是我的作品。
键入“DDD”，选择点云，然后您可以获得德劳尼三角形。

highflyingbird · 发表于 2010-8-24 01:56:59

似乎我做错了什么，这个代码是更快的
计算只有
0.306322秒 - 213，093点
4.976534秒 - 3，265，110点
计算和绘制
1.433781秒 - 213093点
97.373313秒 - 3265110点

copy

static void ArxPointCloud_tpc(void)
  {
    CalDelaunay dt;
    ads_name name = {0L,0L};
    ads_point point = {0.0,0.0,0.0};
    if(acedEntSel(_T("Select Point Cloud"),name,point) != RTNORM)
      return;
    LARGE_INTEGER freq,start,end;   
    QueryPerformanceFrequency(&freq);
    QueryPerformanceCounter(&start);
    // My Point cloud object
    AcDbObjectPointer pCloud( (AcDbObjectId)(AcDbStub*)name[0],AcDb::kForRead);
    if(pCloud.openStatus() != Acad::eOk)
      return;
    
    const AcGePoint3dArray &points = pCloud->PointArray();
    std::vector calPoints;
    calPoints.reserve(points.length());
    for (long i = 0; i workingDatabase(); 
    if(!pDB) return;
    AcDbBlockTableRecordPointer pBlockTableRecord(pDB->currentSpaceId(),AcDb::kForWrite); 
    if(pBlockTableRecord.openStatus() != Acad::eOk)
      return;
    AcGePoint3d A,B,C;
    for (CalDelaunay::Finite_faces_iterator it = dt.finite_faces_begin();
                                             it!=dt.finite_faces_end();++it)
    {
      const CalPoint& pt0 =  (*it).vertex(0)->point();
      const CalPoint& pt1 =  (*it).vertex(1)->point();
      const CalPoint& pt2 =  (*it).vertex(2)->point();
      AcDbFace *pFace = new AcDbFace();
      if(pFace)
      {
        A.x = pt0.x(); A.y = pt0.y(); A.z = pt0.z();
        B.x = pt1.x(); B.y = pt1.y(); B.z = pt1.z();
        C.x = pt2.x(); C.y = pt2.y(); C.z = pt2.z();
        pFace->setVertexAt(0, A);
        pFace->setVertexAt(1, B);
        pFace->setVertexAt(2, C);
        pFace->setVertexAt(3, A);
        if(pBlockTableRecord->appendAcDbEntity(pFace) != Acad::eOk)
          delete pFace;
        else
          pFace->close();
      }
    }
    QueryPerformanceCounter(&end);
    acutPrintf(_T("\n%g seconds - %ld points"),
      (double)(end.QuadPart-start.QuadPart)/freq.QuadPart,points.length() );
  }