138 lines
4.2 KiB
C++
138 lines
4.2 KiB
C++
// standard headers
|
|
#include <stdio.h>
|
|
|
|
// stl headers
|
|
#include <vector>
|
|
|
|
// vcg headers
|
|
//#include<vcg/simplex/vertex/vertex.h>
|
|
//#include<vcg/simplex/face/with/rtfmfn.h>
|
|
#include<vcg/simplex/vertex/base.h>
|
|
#include<vcg/simplex/face/base.h>
|
|
#include<vcg/simplex/face/component_rt.h>
|
|
|
|
#include<vcg/simplex/face/distance.h>
|
|
#include<vcg/complex/trimesh/base.h>
|
|
#include <vcg/complex/trimesh/create/platonic.h>
|
|
#include <vcg/complex/trimesh/update/normal.h>
|
|
#include <vcg/complex/trimesh/update/edges.h>
|
|
#include <vcg/complex/trimesh/update/flag.h>
|
|
#include <vcg/space/intersection3.h>
|
|
|
|
#include <vcg/space/index/aabb_binary_tree/aabb_binary_tree.h>
|
|
|
|
typedef float AScalarType;
|
|
|
|
using namespace vcg;
|
|
|
|
class AEdge;
|
|
class AFace;
|
|
class AVertex : public VertexSimp2< AVertex, AEdge, AFace, vertex::Normal3f, vertex::Coord3f,vertex::BitFlags >{};
|
|
class AFace : public FaceSimp2< AVertex, AEdge, AFace, face::VertexRef, face::Normal3f, face::EdgePlane, face::BitFlags> {};
|
|
|
|
//class AVertex : public vcg::Vertex< AScalarType, AEdge, AFace > { };
|
|
//class AFace : public vcg::FaceRTFMFN< AVertex, AEdge, AFace > { };
|
|
|
|
class AMesh : public vcg::tri::TriMesh< std::vector<AVertex>, std::vector<AFace> > { };
|
|
|
|
typedef vcg::AABBBinaryTreeIndex<AFace, AScalarType, vcg::EmptyClass> AIndex;
|
|
|
|
static AMesh gMesh;
|
|
static AIndex gIndex;
|
|
|
|
static void CreateMesh(void) {
|
|
vcg::tri::Dodecahedron<AMesh>(gMesh);
|
|
|
|
vcg::tri::UpdateFlags<AMesh>::Clear(gMesh);
|
|
vcg::tri::UpdateNormals<AMesh>::PerVertexNormalized(gMesh);
|
|
vcg::tri::UpdateEdges<AMesh>::Set(gMesh);
|
|
}
|
|
|
|
static void SetIndex(void) {
|
|
gIndex.Set(gMesh.face.begin(), gMesh.face.end());
|
|
}
|
|
|
|
static void TestClosest(void) {
|
|
vcg::face::PointDistanceFunctor<AIndex::ScalarType> getPtDist;
|
|
const AIndex::CoordType queryPoint((AIndex::ScalarType)0, (AIndex::ScalarType)0, (AIndex::ScalarType)0);
|
|
const AIndex::ScalarType maxDist = std::numeric_limits<AIndex::ScalarType>::max();
|
|
|
|
AIndex::ObjPtr closestFace;
|
|
AIndex::ScalarType closestDist;
|
|
AIndex::CoordType closestPoint;
|
|
|
|
vcg::EmptyClass a;
|
|
closestFace = gIndex.GetClosest(getPtDist, a, queryPoint, maxDist, closestDist, closestPoint);
|
|
|
|
printf("GetClosest Test:\n");
|
|
|
|
if (closestFace != 0) {
|
|
printf("\tface : 0x%p\n", closestFace);
|
|
printf("\tdistance : %f\n", closestDist);
|
|
printf("\tpoint : [%f, %f, %f]\n", closestPoint[0], closestPoint[1], closestPoint[2]);
|
|
}
|
|
else {
|
|
printf("\tno object found (index is probably empty).\n");
|
|
}
|
|
}
|
|
|
|
static void TestKClosest(void) {
|
|
vcg::face::PointDistanceFunctor<AIndex::ScalarType> getPtDist;
|
|
const unsigned int k = 10;
|
|
const AIndex::CoordType queryPoint((AIndex::ScalarType)0, (AIndex::ScalarType)0, (AIndex::ScalarType)0);
|
|
const AIndex::ScalarType maxDist = std::numeric_limits<AIndex::ScalarType>::max();
|
|
|
|
std::vector<AIndex::ObjPtr> closestObjects;
|
|
std::vector<AIndex::ScalarType> closestDistances;
|
|
std::vector<AIndex::CoordType> closestPoints;
|
|
|
|
vcg::EmptyClass a;
|
|
unsigned int rk = gIndex.GetKClosest(getPtDist, a, k, queryPoint, maxDist, closestObjects, closestDistances, closestPoints);
|
|
|
|
printf("GetKClosest Test:\n");
|
|
printf("\tfound %d objects\n", rk);
|
|
}
|
|
|
|
static void TestRay(void) {
|
|
const bool TEST_BACK_FACES = true;
|
|
|
|
vcg::RayTriangleIntersectionFunctor<TEST_BACK_FACES> rayIntersector;
|
|
const AIndex::ScalarType maxDist = std::numeric_limits<AIndex::ScalarType>::max();
|
|
const AIndex::CoordType rayOrigin((AIndex::ScalarType)0, (AIndex::ScalarType)0, (AIndex::ScalarType)0);
|
|
const AIndex::CoordType rayDirection((AIndex::ScalarType)1, (AIndex::ScalarType)0, (AIndex::ScalarType)0);
|
|
const vcg::Ray3<AIndex::ScalarType, false> ray(rayOrigin, rayDirection);
|
|
|
|
AIndex::ObjPtr isectFace;
|
|
AIndex::ScalarType rayT;
|
|
AIndex::CoordType isectPt;
|
|
|
|
vcg::EmptyClass a;
|
|
isectFace = gIndex.DoRay(rayIntersector, a , ray, maxDist, rayT);
|
|
|
|
printf("DoRay Test:\n");
|
|
if (isectFace != 0) {
|
|
printf("\tface : 0x%p\n", isectFace);
|
|
printf("\tray t : %f\n", rayT);
|
|
}
|
|
else {
|
|
printf("\tno object found (index is probably empty).\n");
|
|
}
|
|
}
|
|
|
|
int main (int /*argc*/, char ** /*argv*/) {
|
|
CreateMesh();
|
|
|
|
SetIndex();
|
|
|
|
printf("Spatial Index Tests\n");
|
|
printf("---\n");
|
|
TestClosest();
|
|
printf("---\n");
|
|
TestKClosest();
|
|
printf("---\n");
|
|
TestRay();
|
|
printf("---\n");
|
|
|
|
return (0);
|
|
}
|