vcglib/apps/test/lem/insert_vertex.h

111 lines
3.8 KiB
C
Raw Normal View History

2004-08-04 22:59:13 +02:00
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004 \/)\/ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
* for more details. *
* *
****************************************************************************/
/****************************************************************************
History
****************************************************************************/
#ifndef __VCG_TRI_INSERT_VERTEX
#define __VCG_TRI_INSERT_VERTEX
#include<vcg\simplex\face\pos.h>
#include<vcg\simplex\face\topology.h>
2004-08-05 18:46:13 +02:00
#include<vcg\complex\trimesh\update\topology.h>
2004-08-04 22:59:13 +02:00
#include<vcg\complex\trimesh\allocate.h>
/// This Class is used for insertiong a vertex in a face
namespace vcg{
namespace tri{
2004-08-05 18:46:13 +02:00
2004-08-04 22:59:13 +02:00
template <class MESH_TYPE>
///insert a vertex iside a face and re-triangolarize v will be pointer to inserted vertex
2004-08-05 18:46:13 +02:00
void InsertVert(MESH_TYPE &m,typename MESH_TYPE::FaceType* &f,typename MESH_TYPE::VertexType* &v)
2004-08-04 22:59:13 +02:00
{
2004-08-05 18:46:13 +02:00
std::vector<MESH_TYPE::FaceType **> local_var;
local_var.push_back(&f);
MESH_TYPE::FaceIterator Finit=vcg::tri::Allocator<MESH_TYPE>::AddFaces(m,3,local_var);
2004-08-04 22:59:13 +02:00
MESH_TYPE::VertexIterator Vi=vcg::tri::Allocator<MESH_TYPE>::AddVertices(m,1);
2004-08-05 18:46:13 +02:00
if (MESH_TYPE::HasVFTopology())
Vi->VFp()=0;
2004-08-04 22:59:13 +02:00
MESH_TYPE::FaceIterator Fi=Finit;
MESH_TYPE::FaceType *F;
//set vertex pointer of new face
for (int i=0;i<3;i++)
{
Fi->V(0)=f->V(i);
Fi->V(1)=f->V((i+1)%3);
Fi->V(2)=&(*Vi);
F=&(*Fi);
//assign topology in substitution of the old one
if (MESH_TYPE::HasFFTopology())
2004-08-05 18:46:13 +02:00
{
vcg::face::FFAttach<MESH_TYPE::FaceType>(F,0,f->FFp(i),f->FFi(i));
}
2004-08-04 22:59:13 +02:00
if (MESH_TYPE::HasVFTopology())
{
vcg::face::VFDetach(f,i);
//put new faces on list of the old vertex and new one
vcg::face::VFAppend<MESH_TYPE::FaceType>(F,0);
vcg::face::VFAppend<MESH_TYPE::FaceType>(F,1);
vcg::face::VFAppend<MESH_TYPE::FaceType>(F,2);
}
Fi++;
}
//then attach the faces between themselfes
Fi=Finit;
MESH_TYPE::FaceIterator Fsucc=Fi;
Fsucc++;
MESH_TYPE::FaceType *F0=&(*Fi);
MESH_TYPE::FaceType *F1=&(*Fsucc);
2004-08-05 18:46:13 +02:00
vcg::face::FFAttach<MESH_TYPE::FaceType>(F0,1,F1,2);
2004-08-04 22:59:13 +02:00
Fi++;
Fsucc++;
F0=&(*Fi);
F1=&(*Fsucc);
2004-08-05 18:46:13 +02:00
vcg::face::FFAttach<MESH_TYPE::FaceType>(F0,1,F1,2);
2004-08-04 22:59:13 +02:00
Fsucc=Finit;
Fi++;
F0=&(*Fi);
F1=&(*Fsucc);
2004-08-05 18:46:13 +02:00
vcg::face::FFAttach<MESH_TYPE::FaceType>(F0,1,F1,2);
2004-08-04 22:59:13 +02:00
//at the end set as deleted the old face that was substituted
f->SetD();
v=&(*Vi);
2004-08-05 18:46:13 +02:00
2004-08-04 22:59:13 +02:00
}
}
}
#endif