void Mesh::Clip(const Plane & plane,
SArray< Vec3<double> > & positivePart,
SArray< Vec3<double> > & negativePart) const
{
const size_t nV = GetNPoints();
if (nV == 0)
{
return;
}
double d;
for (size_t v = 0; v < nV; v++)
{
const Vec3<double> & pt = GetPoint(v);
d = plane.m_a * pt[0] + plane.m_b * pt[1] + plane.m_c * pt[2] + plane.m_d;
if (d > 0.0)
{
positivePart.PushBack(pt);
}
else if (d < 0.0)
{
negativePart.PushBack(pt);
}
else
{
positivePart.PushBack(pt);
negativePart.PushBack(pt);
}
}
}
void
MainWindow::add_toolbar_button(DebuggerCommand* cmd,
const string& tip,
const char* stock,
SArray& pixmap,
Properties& prop)
{
ToolBar* toolbar = get_toolbar(prop);
if (pixmap.empty())
{
pixmap.push_back("");
}
SArray noArg;
Widget* btn =
CHKPTR(toolbar)->add_button(
pixmap.cstrings(),
tip.c_str(),
Gtk_BIND(Gtk_SLOT(this, &MainWindow::run_macro), cmd, noArg),
uisAttachedThreadStop, // FIXME: let the caller specify it
cmd->name(),
stock);
btn->show_all();
commandMap_[cmd] = btn;
}
int Search(const SStringT & strKey,SStudentSearchAdapter *pSearchAdapter)
{
if(strKey.IsEmpty()) return 0;
for(UINT i=0;i<m_stuCurrent.GetCount();i++)
{
SStringT str = SStringT().Format(_T("%s(%u)"),m_stuCurrent[i].strNick,m_stuCurrent[i].imid);
if(str.Find(strKey)!=-1)
{
SStudentSearchAdapter::StudentInfo2 info;
info.strText = str;
info.bExpired = FALSE;
info.nPos = i;
pSearchAdapter->m_searchResult.Add(info);
}
}
for(UINT i=0;i<m_stuExpired.GetCount();i++)
{
SStringT str = SStringT().Format(_T("%s(%u)"),m_stuExpired[i].strNick,m_stuExpired[i].imid);
if(str.Find(strKey)!=-1)
{
SStudentSearchAdapter::StudentInfo2 info;
info.strText = str;
info.bExpired = TRUE;
info.nPos = i;
pSearchAdapter->m_searchResult.Add(info);
}
}
return pSearchAdapter->m_searchResult.GetCount();
}
CStudentAdapter(IStudentCheckChanged * pSelChangedHandler)
:m_pSelChangedHandler(pSelChangedHandler)
,m_bCurrentExpand(TRUE),m_bExpiredExpand(FALSE)
,m_bAllCurrentChecked(FALSE),m_bAllExpiredChecked(FALSE)
{
StudentInfo data[] =
{
{
L"sb no.1",100,
SOUI::CTime(2015,9,1,0,0,0),
SOUI::CTime(2016,9,1,0,0,0),
10000,0
},
{
L"sb no.2",200,
SOUI::CTime(2015,9,2,0,0,0),
SOUI::CTime(2016,9,2,0,0,0),
100000,0
},
{
L"sb no.3",300,
SOUI::CTime(2015,9,3,0,0,0),
SOUI::CTime(2016,9,3,0,0,0),
100000,0
},
};
for(int i=0;i<ARRAYSIZE(data);i++)
{
m_stuCurrent.Add(data[i]);
}
StudentInfo data2[] =
{
{
L"nb no.1",400,
SOUI::CTime(2015,9,1,0,0,0),
SOUI::CTime(2016,9,1,0,0,0),
0,0
},
{
L"nb no.2",500,
SOUI::CTime(2015,9,2,0,0,0),
SOUI::CTime(2016,9,2,0,0,0),
0,0
},
{
L"nb no.3",600,
SOUI::CTime(2015,9,3,0,0,0),
SOUI::CTime(2016,9,3,0,0,0),
0,0
},
};
for(int i=0;i<ARRAYSIZE(data2);i++)
{
m_stuExpired.Add(data2[i]);
}
}
void
MainWindow::toolbar_entry_dialog(DebuggerCommand* command,
Properties* cmdProperties)
{
const string msg = cmdProperties->get_string("message", "");
EntryDialog dialog(msg, debugger().properties(), command->name());
SArray args;
string userString = dialog.run();
if (!userString.empty())
{
args.push_back(userString);
run_macro(command, args);
}
}
/**
* put a leaf in the tree
*/
void insertLeaf(SString & fullPubName, SArray<SString> &pathToLeaf, int indexOfChildName){
if ((unsigned)indexOfChildName == pathToLeaf.size()){
// we are in the leaf node
if ((getType() & LEAF) == LEAF){
// node already leaf - should NEVER happen - we are trying to
//insert a leaf where there is already one
throw BrowseException();
}
// make the node a leaf (or leaf branch)
nodeType = (TreeNodeType)(nodeType | LEAF);
pubName = fullPubName;
return;
}
// make the node a branch (or leaf branch)
nodeType = (TreeNodeType)(nodeType | BRANCH);
SString childNameToLookFor = pathToLeaf[indexOfChildName];
TreeNode * child = children[childNameToLookFor];
if (child == NULL){
child = new TreeNode(childNameToLookFor);
AddChild(child);
}
// Insert leaf lower down the tree
child->insertLeaf(fullPubName, pathToLeaf, indexOfChildName+1);
}
virtual int getItemViewType(int position)
{
if(position == 0 || position == 1+ (m_bCurrentExpand?m_stuCurrent.GetCount():0))
return VT_GROUP;
else
return VT_DATA;
}
bool OnStudentCheckChanged(EventArgs *e)
{
EventSwndStateChanged *e2 = sobj_cast<EventSwndStateChanged>(e);
if(!e2->CheckState(WndState_Check))
return false;
SCheckBox *pCheck = sobj_cast<SCheckBox>(e->sender);
SASSERT(pCheck);
SItemPanel * pItem = sobj_cast<SItemPanel>(pCheck->GetRoot());
int position = (int)pItem->GetItemIndex();
int nBaseCurrent = 1;
int nBaseExpired = 1 + (m_bCurrentExpand?m_stuCurrent.GetCount():0) + 1;
if(position < nBaseExpired)
{
m_stuCurrent[position - nBaseCurrent].bChecked = pCheck->IsChecked();
}else
{
m_stuExpired[position - nBaseExpired].bChecked = pCheck->IsChecked();
}
if(m_pSelChangedHandler)
{
int nSelCur = 0, nSelExp=0;
for(UINT i=0;i<m_stuCurrent.GetCount();i++)
{
nSelCur += m_stuCurrent[i].bChecked;
}
for(UINT i=0;i<m_stuExpired.GetCount();i++)
{
nSelExp += m_stuExpired[i].bChecked;
}
BOOL bAllCurrentChecked = nSelCur == m_stuCurrent.GetCount();
BOOL bAllExpiredChecked = nSelExp == m_stuExpired.GetCount();
if(bAllCurrentChecked!=m_bAllCurrentChecked || bAllExpiredChecked != m_bAllExpiredChecked)
{
m_bAllCurrentChecked = bAllCurrentChecked;
m_bAllExpiredChecked = bAllExpiredChecked;
notifyDataSetChanged();
}
m_pSelChangedHandler->OnStudentCheckChanged(nSelCur,nSelExp);
}
return true;
}
virtual void getView(int position, SWindow * pItem, pugi::xml_node xmlTemplate)
{
int nViewType = getItemViewType(position);
if(pItem->GetChildrenCount() == 0)
{
pugi::xml_node xmlItem;
switch(nViewType)
{
case VT_GROUP: xmlItem = xmlTemplate.child(L"item_group");break;
case VT_DATA: xmlItem = xmlTemplate.child(L"item_data");break;
}
pItem->InitFromXml(xmlItem);
}
if(nViewType == VT_GROUP)
{
SToggle * pSwitch=pItem->FindChildByID2<SToggle>(R.id.tgl_tv_expand);
pSwitch->SetToggle(position==0?m_bCurrentExpand:m_bExpiredExpand);
pSwitch->GetEventSet()->subscribeEvent(EVT_CMD,Subscriber(&CStudentAdapter::OnBtnGroupExpand,this));
pItem->FindChildByID(R.id.txt_group)->SetWindowText(TR(GETSTRING(position==0?R.string.current_student:R.string.expired_student),L""));
pItem->GetEventSet()->subscribeEvent(EVT_ITEMPANEL_DBCLICK,Subscriber(&CStudentAdapter::OnGroupDblClick,this));
SCheckBox *pGroupCheck = pItem->FindChildByID2<SCheckBox>(R.id.chk_select_group);
pGroupCheck->GetEventSet()->subscribeEvent(EVT_STATECHANGED,Subscriber(&CStudentAdapter::OnGroupSelectCheckChanged,this));
pGroupCheck->GetEventSet()->setMutedState(true);
pGroupCheck->SetCheck(position==0?m_bAllCurrentChecked:m_bAllExpiredChecked);
pGroupCheck->GetEventSet()->setMutedState(false);
}else
{
int nBaseCurrent = 1;
int nBaseExpired = 1 + (m_bCurrentExpand?m_stuCurrent.GetCount():0) + 1;
if(position< nBaseExpired)
{//current student
StudentInfo & stuInfo = m_stuCurrent[position-nBaseCurrent];
SCheckBox *pCheckBox = pItem->FindChildByID2<SCheckBox>(R.id.txt_nick);
pCheckBox->GetEventSet()->subscribeEvent(EVT_STATECHANGED,Subscriber(&CStudentAdapter::OnStudentCheckChanged,this));
pCheckBox->GetEventSet()->setMutedState(true);
pCheckBox->SetCheck(stuInfo.bChecked);
pCheckBox->GetEventSet()->setMutedState(false);
pCheckBox->SetWindowText(SStringT().Format(_T("%s(%u)"),stuInfo.strNick,stuInfo.imid));
pItem->FindChildByID(R.id.txt_loyal_degree)->SetWindowText(SStringT().Format(_T("%d"),stuInfo.nLoyalDegree));
pItem->FindChildByID(R.id.txt_time_span)->SetWindowText(stuInfo.tm1.Format(_T("%Y/%m/%d") + SStringT(_T(" - ")) + stuInfo.tm2.Format(_T("%Y/%m/%d"))));
}else
{//expired student
StudentInfo & stuInfo = m_stuExpired[position-nBaseExpired];
SCheckBox *pCheckBox = pItem->FindChildByID2<SCheckBox>(R.id.txt_nick);
pCheckBox->GetEventSet()->subscribeEvent(EVT_STATECHANGED,Subscriber(&CStudentAdapter::OnStudentCheckChanged,this));
pCheckBox->GetEventSet()->setMutedState(true);
pCheckBox->SetCheck(stuInfo.bChecked);
pCheckBox->GetEventSet()->setMutedState(false);
pCheckBox->SetWindowText(SStringT().Format(_T("%s(%u)"),stuInfo.strNick,stuInfo.imid));
pItem->FindChildByID(R.id.txt_loyal_degree)->SetWindowText(SStringT().Format(_T("%d"),stuInfo.nLoyalDegree));
pItem->FindChildByID(R.id.txt_time_span)->SetWindowText(stuInfo.tm1.Format(_T("%Y/%m/%d") + SStringT(_T(" - ")) + stuInfo.tm2.Format(_T("%Y/%m/%d"))));
}
}
}
bool OnGroupSelectCheckChanged(EventArgs *e)
{
EventSwndStateChanged *e2 = sobj_cast<EventSwndStateChanged>(e);
SASSERT(e2);
if(!e2->CheckState(WndState_Check))
return false;
SCheckBox *pCheckBox = sobj_cast<SCheckBox>(e->sender);
SASSERT(pCheckBox);
SItemPanel * pItem = sobj_cast<SItemPanel>(pCheckBox->GetRoot());
int position = (int)pItem->GetItemIndex();
int nSelCur = 0, nSelExp=0;
if(position == 0)
{
for(UINT i=0;i<m_stuCurrent.GetCount();i++)
{
m_stuCurrent[i].bChecked = (e2->dwNewState & WndState_Check)!=0;
nSelCur += m_stuCurrent[i].bChecked;
}
for(UINT i=0;i<m_stuExpired.GetCount();i++)
{
nSelExp += m_stuExpired[i].bChecked;
}
}else
{
for(UINT i=0;i<m_stuCurrent.GetCount();i++)
{
nSelCur += m_stuCurrent[i].bChecked;
}
for(UINT i=0;i<m_stuExpired.GetCount();i++)
{
m_stuExpired[i].bChecked = (e2->dwNewState & WndState_Check)!=0;;
nSelExp += m_stuExpired[i].bChecked;
}
}
m_bAllCurrentChecked = nSelCur == m_stuCurrent.GetCount();
m_bAllExpiredChecked = nSelExp == m_stuExpired.GetCount();
notifyDataSetChanged();
if(m_pSelChangedHandler)
m_pSelChangedHandler->OnStudentCheckChanged(nSelCur,nSelExp);
return true;
}
int EnsureKeyVisible(BOOL bExpired,int iItem)
{
if(!bExpired)
{
if(!m_bCurrentExpand)
{
m_bCurrentExpand = TRUE;
notifyDataSetChanged();
}
return 1+iItem;
}else
{
if(!m_bExpiredExpand)
{
m_bExpiredExpand = TRUE;
notifyDataSetChanged();
}
return 2 + iItem + (m_bCurrentExpand?m_stuCurrent.GetCount():0);
}
}
int main () {
SArray<int>* a = new SArray<int>(5, 7, 0);
cout << "initialized" << endl;
a->insert(3, 5, 8);
cout << "first insert" << endl;
a->insert(3, 6, 20);
cout << "second insert" << endl;
a->insert(1, 2, 40);
cout << "third insert" << endl;
cout << "inserted" << endl;
cout << "accessed: " << a->access(3, 5) << endl;
cout << "accessed: " << a->access(1, 1) << endl;
a->remove(3, 6);
a->remove(1, 1);
a->print();
delete a;
return 0;
}
CSmsRecordAdapter()
{
RecordInfo recs[] =
{
{
SOUI::CTime(2015,9,1,0,0,0),
_T("sb no.1"),
_T("A¹ÉÃ÷Ì챩µø£¬ÓÐǮûǮʹ¾¢Âò¡£"),
},
{
SOUI::CTime(2015,9,1,0,0,0),
_T("sb no.2"),
_T("A¹ÉÃ÷Ì챩µø£¬ÓÐǮûǮʹ¾¢Âò¡£"),
},
{
SOUI::CTime(2015,9,1,0,0,0),
_T("sb no.3"),
_T("A¹ÉÃ÷Ì챩µø£¬ÓÐǮûǮʹ¾¢Âò¡£"),
},
{
SOUI::CTime(2015,9,1,0,0,0),
_T("sb no.4"),
_T("A¹ÉÃ÷Ì챩µø£¬ÓÐǮûǮʹ¾¢Âò¡£"),
},
{
SOUI::CTime(2015,9,1,0,0,0),
_T("sb no.5"),
_T("A¹ÉÃ÷Ì챩µø£¬ÓÐǮûǮʹ¾¢Âò¡£"),
},
};
for(int i=0;i<ARRAYSIZE(recs);i++)
{
m_smsRecord.Add(recs[i]);
}
}
void MeshDecimator::EdgeCollapse(long v1, long v2)
{
long u, w;
int shift;
long idTriangle;
for(size_t itT = 0; itT < m_vertices[v2].m_triangles.Size(); ++itT)
{
idTriangle = m_vertices[v2].m_triangles[itT];
if (m_triangles[idTriangle].X() == v2)
{
shift = 0;
u = m_triangles[idTriangle].Y();
w = m_triangles[idTriangle].Z();
}
else if (m_triangles[idTriangle].Y() == v2)
{
shift = 1;
u = m_triangles[idTriangle].X();
w = m_triangles[idTriangle].Z();
}
else
{
shift = 2;
u = m_triangles[idTriangle].X();
w = m_triangles[idTriangle].Y();
}
if ((u == v1) || (w == v1))
{
m_trianglesTags[idTriangle] = false;
m_vertices[u].m_triangles.Erase(idTriangle);
m_vertices[w].m_triangles.Erase(idTriangle);
m_nTriangles--;
}
else if (GetTriangle(v1, u, w) == -1)
{
m_vertices[v1].m_triangles.Insert(idTriangle);
m_triangles[idTriangle][shift] = v1;
}
else
{
m_trianglesTags[idTriangle] = false;
m_vertices[u].m_triangles.Erase(idTriangle);
m_vertices[w].m_triangles.Erase(idTriangle);
m_nTriangles--;
}
}
long idEdge = 0;
for(size_t itE = 0; itE < m_vertices[v2].m_edges.Size(); ++itE)
{
idEdge = m_vertices[v2].m_edges[itE];
w = (m_edges[idEdge].m_v1 == v2)? m_edges[idEdge].m_v2 : m_edges[idEdge].m_v1;
if (w==v1)
{
m_edges[idEdge].m_tag = false;
m_vertices[w].m_edges.Erase(idEdge);
m_nEdges--;
}
else if ( GetEdge(v1, w) == -1)
{
if (m_edges[idEdge].m_v1 == v2) m_edges[idEdge].m_v1 = v1;
else m_edges[idEdge].m_v2 = v1;
m_vertices[v1].m_edges.Insert(idEdge);
}
else
{
m_edges[idEdge].m_tag = false;
m_vertices[w].m_edges.Erase(idEdge);
m_nEdges--;
}
}
m_vertices[v2].m_tag = false;
m_nVertices--;
// update boundary edges
SArray<long, 64> incidentVertices;
incidentVertices.PushBack(v1);
for(size_t itE = 0; itE < m_vertices[v1].m_edges.Size(); ++itE)
{
incidentVertices.PushBack((m_edges[idEdge].m_v1!= v1)?m_edges[idEdge].m_v1:m_edges[idEdge].m_v2);
idEdge = m_vertices[v1].m_edges[itE];
m_edges[idEdge].m_onBoundary = (IsBoundaryEdge(m_edges[idEdge].m_v1, m_edges[idEdge].m_v2) != -1);
}
// update boundary vertices
long idVertex;
for(size_t itV = 0; itV < incidentVertices.Size(); ++itV)
{
idVertex = incidentVertices[itV];
m_vertices[idVertex].m_onBoundary = false;
for(size_t itE = 0; itE < m_vertices[idVertex].m_edges.Size(); ++itE)
{
idEdge = m_vertices[idVertex].m_edges[itE];
if (m_edges[idEdge].m_onBoundary)
{
m_vertices[idVertex].m_onBoundary = true;
break;
}
}
}
}
virtual int getCount()
{
return m_smsRecord.GetCount();
}
VARIANT ExecuteScript(IWebBrowser2 *pWebBrowser, const SStringW & fun,SArray<SStringW> & params)
{
VARIANT varErr;
VariantInit( &varErr );
//get document dispatch interface
IDispatch* pDisp = NULL;
HRESULT hr = pWebBrowser->get_Document( &pDisp );
if ( FAILED( hr ) || pDisp == NULL )
{
return varErr;
}
IHTMLDocument2* pDoc = NULL;
pDisp->QueryInterface( IID_IHTMLDocument2,(void**)&pDoc );
pDisp->Release();
IDispatch* pScript = NULL;
hr = pDoc->get_Script( &pScript );
pDoc->Release();
if ( FAILED( hr ) || pScript == NULL )
{
return varErr;
}
sbstr bstrMember((int)fun.GetLength(),fun );
DISPID dispid = 0;
BSTR bstr = (BSTR)bstrMember;
hr = pScript->GetIDsOfNames( IID_NULL,&(bstr),1,LOCALE_SYSTEM_DEFAULT,&dispid );
if ( FAILED( hr ) )
{
return varErr;
}
DISPPARAMS dispparams;
::ZeroMemory( &dispparams,sizeof( DISPPARAMS ) );
dispparams.cArgs = (UINT)params.GetCount();
dispparams.rgvarg = new VARIANT[dispparams.cArgs];
dispparams.cNamedArgs = 0;
for ( size_t i = 0;i < params.GetCount();i++ )
{
size_t indx = params.GetCount() - i - 1;
sbstr bstrParam((int)params[indx].GetLength(),params[indx]);
dispparams.rgvarg[i].bstrVal = bstrParam.Release();
dispparams.rgvarg[i].vt = VT_BSTR;
}
EXCEPINFO excepinfo;
::ZeroMemory( &excepinfo,sizeof( EXCEPINFO ) );
VARIANT varRet;
UINT nArgErr = (UINT)-1; //initialize to invalid arg
hr = pScript->Invoke( dispid,IID_NULL,0,DISPATCH_METHOD,&dispparams,&varRet,&excepinfo,&nArgErr );
delete []dispparams.rgvarg;
pScript->Release();
if ( FAILED( hr ) )
{
return varErr;
}
return varRet;
}
virtual int getCount()
{
return 2 + (m_bCurrentExpand?m_stuCurrent.GetCount():0) + (m_bExpiredExpand?m_stuExpired.GetCount():0);
}
double MeshDecimator::ComputeEdgeCost(long v1, long v2, Vec3<Float> & newPos) const
{
double Q[10];
double M[12];
Vec3<double> pos;
for(int i = 0; i < 10; ++i) Q[i] = m_vertices[v1].m_Q[i] + m_vertices[v2].m_Q[i];
M[0] = Q[0]; // (0, 0)
M[1] = Q[1]; // (0, 1)
M[2] = Q[2]; // (0, 2)
M[3] = Q[3]; // (0, 3)
M[4] = Q[1]; // (1, 0)
M[5] = Q[4]; // (1, 1)
M[6] = Q[5]; // (1, 2)
M[7] = Q[6]; // (1, 3)
M[8] = Q[2]; // (2, 0)
M[9] = Q[5]; // (2, 1)
M[10] = Q[7]; // (2, 2);
M[11] = Q[8]; // (2, 3);
double det = M[0] * M[5] * M[10] + M[1] * M[6] * M[8] + M[2] * M[4] * M[9]
- M[0] * M[6] * M[9] - M[1] * M[4] * M[10]- M[2] * M[5] * M[8];
if (det != 0.0)
{
double d = 1.0 / det;
pos.X() = d * (M[1]*M[7]*M[10] + M[2]*M[5]*M[11] + M[3]*M[6]*M[9]
-M[1]*M[6]*M[11] - M[2]*M[7]*M[9] - M[3]*M[5]*M[10]);
pos.Y() = d * (M[0]*M[6]*M[11] + M[2]*M[7]*M[8] + M[3]*M[4]*M[10]
-M[0]*M[7]*M[10] - M[2]*M[4]*M[11] - M[3]*M[6]*M[8]);
pos.Z() = d * (M[0]*M[7]*M[9] + M[1]*M[4]*M[11] + M[3]*M[5]*M[8]
-M[0]*M[5]*M[11] - M[1]*M[7]*M[8] - M[3]*M[4]*M[9]);
newPos.X() = static_cast<Float>(pos.X());
newPos.Y() = static_cast<Float>(pos.Y());
newPos.Z() = static_cast<Float>(pos.Z());
}
else
{
const Float w = static_cast<Float>(0.5f);
newPos = w * m_points[v1] + w * m_points[v2];
pos.X() = static_cast<double>(newPos.X());
pos.Y() = static_cast<double>(newPos.Y());
pos.Z() = static_cast<double>(newPos.Z());
}
double qem = pos.X() * (Q[0] * pos.X() + Q[1] * pos.Y() + Q[2] * pos.Z() + Q[3]) +
pos.Y() * (Q[1] * pos.X() + Q[4] * pos.Y() + Q[5] * pos.Z() + Q[6]) +
pos.Z() * (Q[2] * pos.X() + Q[5] * pos.Y() + Q[7] * pos.Z() + Q[8]) +
(Q[3] * pos.X() + Q[6] * pos.Y() + Q[8] * pos.Z() + Q[9]) ;
Vec3<Float> d1;
Vec3<Float> d2;
Vec3<Float> n1;
Vec3<Float> n2;
Vec3<Float> oldPosV1 = m_points[v1];
Vec3<Float> oldPosV2 = m_points[v2];
SArray<long, SARRAY_DEFAULT_MIN_SIZE> triangles = m_vertices[v1].m_triangles;
long idTriangle;
for(size_t itT = 0; itT < m_vertices[v2].m_triangles.Size(); ++itT)
{
idTriangle = m_vertices[v2].m_triangles[itT];
triangles.Insert(idTriangle);
}
long a[3];
for(size_t itT = 0; itT != triangles.Size(); ++itT)
{
idTriangle = triangles[itT];
a[0] = m_triangles[idTriangle].X();
a[1] = m_triangles[idTriangle].Y();
a[2] = m_triangles[idTriangle].Z();
d1 = m_points[a[1]] - m_points[a[0]];
d2 = m_points[a[2]] - m_points[a[0]];
n1 = d1^d2;
m_points[v1] = newPos;
m_points[v2] = newPos;
d1 = m_points[a[1]] - m_points[a[0]];
d2 = m_points[a[2]] - m_points[a[0]];
n2 = d1^d2;
m_points[v1] = oldPosV1;
m_points[v2] = oldPosV2;
n1.Normalize();
n2.Normalize();
if (n1*n2 < 0.0)
{
return std::numeric_limits<double>::max();
}
}
if ( m_ecolManifoldConstraint && !ManifoldConstraint(v1, v2))
{
return std::numeric_limits<double>::max();
}
return qem;
}
// copy values of another array
void copy (SArray<T> const& orig) {
assert(size()==orig.size());
for (size_t idx = 0; idx<size(); ++idx) {
storage[idx] = orig.storage[idx];
}
}
// copy constructor
SArray (SArray<T> const& orig)
: storage(new T[orig.size()]), storage_size(orig.size()) {
copy(orig);
}
ICHullError ICHull::Process()
{
unsigned int addedPoints = 0;
if (m_mesh.GetNVertices() < 3) {
return ICHullErrorNotEnoughPoints;
}
if (m_mesh.GetNVertices() == 3) {
m_isFlat = true;
CircularListElement<TMMTriangle>* t1 = m_mesh.AddTriangle();
CircularListElement<TMMTriangle>* t2 = m_mesh.AddTriangle();
CircularListElement<TMMVertex>* v0 = m_mesh.m_vertices.GetHead();
CircularListElement<TMMVertex>* v1 = v0->GetNext();
CircularListElement<TMMVertex>* v2 = v1->GetNext();
// Compute the normal to the plane
Vec3<double> p0 = v0->GetData().m_pos;
Vec3<double> p1 = v1->GetData().m_pos;
Vec3<double> p2 = v2->GetData().m_pos;
m_normal = (p1 - p0) ^ (p2 - p0);
m_normal.Normalize();
t1->GetData().m_vertices[0] = v0;
t1->GetData().m_vertices[1] = v1;
t1->GetData().m_vertices[2] = v2;
t2->GetData().m_vertices[0] = v1;
t2->GetData().m_vertices[1] = v2;
t2->GetData().m_vertices[2] = v2;
return ICHullErrorOK;
}
if (m_isFlat) {
m_mesh.m_edges.Clear();
m_mesh.m_triangles.Clear();
m_isFlat = false;
}
if (m_mesh.GetNTriangles() == 0) // we have to create the first polyhedron
{
ICHullError res = DoubleTriangle();
if (res != ICHullErrorOK) {
return res;
}
else {
addedPoints += 3;
}
}
CircularList<TMMVertex>& vertices = m_mesh.GetVertices();
// go to the first added and not processed vertex
while (!(vertices.GetHead()->GetPrev()->GetData().m_tag)) {
vertices.Prev();
}
while (!vertices.GetData().m_tag) // not processed
{
vertices.GetData().m_tag = true;
if (ProcessPoint()) {
addedPoints++;
CleanUp(addedPoints);
vertices.Next();
if (!GetMesh().CheckConsistancy()) {
size_t nV = m_mesh.GetNVertices();
CircularList<TMMVertex>& vertices = m_mesh.GetVertices();
for (size_t v = 0; v < nV; ++v) {
if (vertices.GetData().m_name == sc_dummyIndex) {
vertices.Delete();
break;
}
vertices.Next();
}
return ICHullErrorInconsistent;
}
}
}
if (m_isFlat) {
SArray<CircularListElement<TMMTriangle>*> trianglesToDuplicate;
size_t nT = m_mesh.GetNTriangles();
for (size_t f = 0; f < nT; f++) {
TMMTriangle& currentTriangle = m_mesh.m_triangles.GetHead()->GetData();
if (currentTriangle.m_vertices[0]->GetData().m_name == sc_dummyIndex || currentTriangle.m_vertices[1]->GetData().m_name == sc_dummyIndex || currentTriangle.m_vertices[2]->GetData().m_name == sc_dummyIndex) {
m_trianglesToDelete.PushBack(m_mesh.m_triangles.GetHead());
for (int k = 0; k < 3; k++) {
for (int h = 0; h < 2; h++) {
if (currentTriangle.m_edges[k]->GetData().m_triangles[h] == m_mesh.m_triangles.GetHead()) {
currentTriangle.m_edges[k]->GetData().m_triangles[h] = 0;
break;
}
}
}
}
else {
trianglesToDuplicate.PushBack(m_mesh.m_triangles.GetHead());
}
m_mesh.m_triangles.Next();
}
size_t nE = m_mesh.GetNEdges();
for (size_t e = 0; e < nE; e++) {
TMMEdge& currentEdge = m_mesh.m_edges.GetHead()->GetData();
if (currentEdge.m_triangles[0] == 0 && currentEdge.m_triangles[1] == 0) {
m_edgesToDelete.PushBack(m_mesh.m_edges.GetHead());
}
m_mesh.m_edges.Next();
}
size_t nV = m_mesh.GetNVertices();
CircularList<TMMVertex>& vertices = m_mesh.GetVertices();
for (size_t v = 0; v < nV; ++v) {
if (vertices.GetData().m_name == sc_dummyIndex) {
vertices.Delete();
}
else {
vertices.GetData().m_tag = false;
vertices.Next();
}
}
CleanEdges();
CleanTriangles();
CircularListElement<TMMTriangle>* newTriangle;
for (size_t t = 0; t < trianglesToDuplicate.Size(); t++) {
newTriangle = m_mesh.AddTriangle();
newTriangle->GetData().m_vertices[0] = trianglesToDuplicate[t]->GetData().m_vertices[1];
newTriangle->GetData().m_vertices[1] = trianglesToDuplicate[t]->GetData().m_vertices[0];
newTriangle->GetData().m_vertices[2] = trianglesToDuplicate[t]->GetData().m_vertices[2];
}
}
return ICHullErrorOK;
}
void MainWindow::add_command(DebuggerCommand* cmd)
{
if (!is_ui_thread())
{
run_on_ui_thread(command(&MainWindow::add_command, this, cmd));
}
else
{
dbgout(0) << __func__ << ": " << cmd->name() << endl;
//
// The command object may implement a Properties interface,
// (a dictionary, essentially) which allows the various
// CommandCenter implementations to extract the parameters
// that apply.
//
// In this particular case, we look for params that tell:
// 1) whether the command to be added is a toolbar button
// (other types are not supported yet, but things such as
// menu items may are on the drawing board and may be added soon),
// and:
// 2) if a toolbar button, what are its attributes (tooltip
// text, what pixmap or stock image to show, etc).
//
if (Properties* prop = interface_cast<Properties*>(cmd))
{
SArray pixmap;
string tip = prop->get_string("tooltip", "");
const char* stock = prop->get_string("stock");
if (const char* xpm = prop->get_string("pixmap"))
{
typedef boost::char_separator<char> Delim;
typedef boost::tokenizer<Delim> Tokenizer;
string tmp(xpm);
Tokenizer tok(tmp, Delim("\n"));
Tokenizer::iterator i = tok.begin();
for (; i != tok.end(); ++i)
{
pixmap.push_back(*i);
}
}
if (const char* type = prop->get_string("type"))
{
if (strcmp(type, "tool") == 0)
{
add_toolbar_button(cmd, tip, stock, pixmap, *prop);
}
else if (strcmp(type, "tool-dialog") == 0)
{
add_toolbar_dialog(cmd, tip, stock, pixmap, *prop);
}
else
{
throw runtime_error("pluggable command type \""
+ string(type)
+ "\" not supported");
}
}
}
}
}
bool MeshDecimator::EdgeCollapse(double & qem)
{
MDEdgePriorityQueue currentEdge;
long v1, v2;
bool done = false;
do
{
done = false;
if (m_pqueue.size() == 0)
{
done = true;
break;
}
else
{
currentEdge = m_pqueue.top();
m_pqueue.pop();
}
}
while ( (!m_edges[currentEdge.m_name].m_tag) || (m_edges[currentEdge.m_name].m_qem != currentEdge.m_qem));
if (done) return false;
v1 = m_edges[currentEdge.m_name].m_v1;
v2 = m_edges[currentEdge.m_name].m_v2;
qem = currentEdge.m_qem;
EdgeCollapse(v1, v2);
m_points[v1] = m_edges[currentEdge.m_name].m_pos ;
for(int k = 0; k < 10; k++) m_vertices[v1].m_Q[k] += m_vertices[v2].m_Q[k];
// Update priority queue
long idEdge;
long a, b;
SArray<long, SARRAY_DEFAULT_MIN_SIZE> incidentVertices;
for(size_t itE = 0; itE < m_vertices[v1].m_edges.Size(); ++itE)
{
idEdge = m_vertices[v1].m_edges[itE];
a = m_edges[idEdge].m_v1;
b = m_edges[idEdge].m_v2;
incidentVertices.PushBack((a != v1)?a:b);
MDEdgePriorityQueue pqEdge;
pqEdge.m_qem = m_edges[idEdge].m_qem = ComputeEdgeCost(a, b, m_edges[idEdge].m_pos);
pqEdge.m_name = idEdge;
m_pqueue.push(pqEdge);
}
long idVertex;
for(size_t itV = 0; itV< incidentVertices.Size(); ++itV)
{
idVertex = incidentVertices[itV];
for(size_t itE = 0; itE < m_vertices[idVertex].m_edges.Size(); ++itE)
{
idEdge = m_vertices[idVertex].m_edges[itE];
a = m_edges[idEdge].m_v1;
b = m_edges[idEdge].m_v2;
if ( a!=v1 && b!=v1)
{
MDEdgePriorityQueue pqEdge;
pqEdge.m_qem = m_edges[idEdge].m_qem = ComputeEdgeCost(a, b, m_edges[idEdge].m_pos);
pqEdge.m_name = idEdge;
m_pqueue.push(pqEdge);
}
}
}
return true;
}
