2020-11-27 11:47:21 +01:00
|
|
|
#include "edgemesh.hpp"
|
|
|
|
#include "vcg/simplex/face/topology.h"
|
2021-11-15 10:08:39 +01:00
|
|
|
//#include <wrap/nanoply/include/nanoplyWrapper.hpp>
|
|
|
|
#include <wrap/io_trimesh/export.h>
|
|
|
|
#include <wrap/io_trimesh/import.h>
|
2020-11-27 11:47:21 +01:00
|
|
|
|
|
|
|
Eigen::MatrixX2i VCGEdgeMesh::getEigenEdges() const { return eigenEdges; }
|
|
|
|
|
2021-11-15 10:08:39 +01:00
|
|
|
std::vector<vcg::Point2i> VCGEdgeMesh::getEdges()
|
|
|
|
{
|
|
|
|
getEdges(eigenEdges);
|
|
|
|
std::vector<vcg::Point2i> edges(eigenEdges.rows());
|
|
|
|
for (int ei = 0; ei < eigenEdges.rows(); ei++) {
|
|
|
|
edges[ei] = vcg::Point2i(eigenEdges(ei, 0), eigenEdges(ei, 1));
|
|
|
|
}
|
|
|
|
return edges;
|
|
|
|
}
|
|
|
|
|
2021-04-08 20:03:23 +02:00
|
|
|
Eigen::MatrixX3d VCGEdgeMesh::getEigenVertices() {
|
|
|
|
getVertices(eigenVertices);
|
2020-11-27 11:47:21 +01:00
|
|
|
return eigenVertices;
|
|
|
|
}
|
|
|
|
|
|
|
|
Eigen::MatrixX3d VCGEdgeMesh::getEigenEdgeNormals() const {
|
|
|
|
return eigenEdgeNormals;
|
|
|
|
}
|
|
|
|
|
2021-04-08 20:03:23 +02:00
|
|
|
bool VCGEdgeMesh::save(const string &plyFilename)
|
|
|
|
{
|
2021-04-30 12:13:58 +02:00
|
|
|
std::string filename = plyFilename;
|
|
|
|
if (filename.empty()) {
|
2021-05-01 17:44:54 +02:00
|
|
|
filename = std::filesystem::current_path().append(getLabel() + ".ply").string();
|
2021-04-30 12:13:58 +02:00
|
|
|
} else if (std::filesystem::is_directory(std::filesystem::path(plyFilename))) {
|
2021-05-01 17:44:54 +02:00
|
|
|
filename = std::filesystem::path(plyFilename).append(getLabel() + ".ply").string();
|
2021-04-30 12:13:58 +02:00
|
|
|
}
|
|
|
|
assert(std::filesystem::path(filename).extension().string() == ".ply");
|
2021-04-08 20:03:23 +02:00
|
|
|
unsigned int mask = 0;
|
2021-11-15 10:08:39 +01:00
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTCOORD;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_EDGEINDEX;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTNORMAL;
|
2021-04-30 12:13:58 +02:00
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTCOLOR;
|
2021-11-15 10:08:39 +01:00
|
|
|
// if (nanoply::NanoPlyWrapper<VCGEdgeMesh>::SaveModel(filename.c_str(), *this, mask, false) != 0) {
|
|
|
|
if (vcg::tri::io::Exporter<VCGEdgeMesh>::Save(*this, filename.c_str(), mask) != 0) {
|
2021-04-08 20:03:23 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2020-12-14 17:02:54 +01:00
|
|
|
}
|
2020-11-27 11:47:21 +01:00
|
|
|
|
|
|
|
void VCGEdgeMesh::GeneratedRegularSquaredPattern(
|
|
|
|
const double angleDeg, std::vector<std::vector<vcg::Point2d>> &pattern,
|
|
|
|
const size_t &desiredNumberOfSamples) {
|
|
|
|
static const size_t piSamples = 10;
|
|
|
|
|
|
|
|
// generate a pattern in a 1x1 quad
|
|
|
|
const vcg::Point2d offset(0, 0);
|
|
|
|
|
|
|
|
const size_t samplesNo = desiredNumberOfSamples;
|
|
|
|
// std::max(desiredNumberOfSamples, size_t(piSamples * (angleDeg /
|
|
|
|
// 180)));
|
|
|
|
const double angle = vcg::math::ToRad(angleDeg);
|
|
|
|
|
|
|
|
pattern.clear();
|
|
|
|
|
|
|
|
// first arm
|
|
|
|
std::vector<vcg::Point2d> arm;
|
|
|
|
{
|
|
|
|
for (int k = 0; k <= samplesNo; k++) {
|
|
|
|
const double t = double(k) / samplesNo;
|
|
|
|
const double a = (1 - t) * angle;
|
2021-03-15 18:04:29 +01:00
|
|
|
// const double r = vcg::math::Sin(t*M_PI_2) /*(1-((1-t)*(1-t)))*/ *
|
|
|
|
// 0.5;
|
2020-11-27 11:47:21 +01:00
|
|
|
const double r = t * 0.5; // linear
|
|
|
|
|
|
|
|
vcg::Point2d p(vcg::math::Cos(a), vcg::math::Sin(a));
|
|
|
|
|
|
|
|
arm.push_back((p * r));
|
|
|
|
}
|
|
|
|
pattern.push_back(arm);
|
|
|
|
}
|
|
|
|
|
|
|
|
// other arms
|
|
|
|
for (int i = 0; i < 3; i++) {
|
|
|
|
for (vcg::Point2d &p : arm) {
|
|
|
|
p = vcg::Point2d(-p.Y(), p.X());
|
|
|
|
}
|
|
|
|
pattern.push_back(arm);
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(pattern.size() == 4);
|
|
|
|
|
|
|
|
// offset all
|
|
|
|
for (auto &arm : pattern) {
|
|
|
|
for (vcg::Point2d &p : arm) {
|
|
|
|
p += offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::createSpiral(const float °reesOfArm,
|
|
|
|
const size_t &numberOfSamples) {
|
|
|
|
std::vector<std::vector<vcg::Point2d>> spiralPoints;
|
|
|
|
GeneratedRegularSquaredPattern(degreesOfArm, spiralPoints, numberOfSamples);
|
|
|
|
|
|
|
|
for (size_t armIndex = 0; armIndex < spiralPoints.size(); armIndex++) {
|
|
|
|
for (size_t pointIndex = 0; pointIndex < spiralPoints[armIndex].size() - 1;
|
|
|
|
pointIndex++) {
|
|
|
|
const vcg::Point2d p0 = spiralPoints[armIndex][pointIndex];
|
|
|
|
const vcg::Point2d p1 = spiralPoints[armIndex][pointIndex + 1];
|
|
|
|
CoordType n(0, 0, 1);
|
|
|
|
auto ei = vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(
|
|
|
|
*this, VCGEdgeMesh::CoordType(p0.X(), p0.Y(), 0),
|
|
|
|
VCGEdgeMesh::CoordType(p1.X(), p1.Y(), 0));
|
|
|
|
ei->cV(0)->N() = n;
|
|
|
|
ei->cV(1)->N() = n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// setDefaultAttributes();
|
|
|
|
}
|
|
|
|
|
2020-12-03 19:56:03 +01:00
|
|
|
bool VCGEdgeMesh::createSpanGrid(const size_t squareGridDimension) {
|
|
|
|
return createSpanGrid(squareGridDimension, squareGridDimension);
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
|
2020-12-03 19:56:03 +01:00
|
|
|
bool VCGEdgeMesh::createSpanGrid(const size_t desiredWidth,
|
2020-12-14 17:02:54 +01:00
|
|
|
const size_t desiredHeight) {
|
2020-11-27 11:47:21 +01:00
|
|
|
std::cout << "Grid of dimensions:" << desiredWidth << "," << desiredHeight
|
|
|
|
<< std::endl;
|
|
|
|
const VCGEdgeMesh::CoordType n(0, 0, 1);
|
|
|
|
int x = 0;
|
|
|
|
int y = 0;
|
|
|
|
// for (size_t vi = 0; vi < numberOfVertices; vi++) {
|
|
|
|
while (y <= desiredHeight) {
|
|
|
|
// std::cout << x << " " << y << std::endl;
|
|
|
|
auto p = VCGEdgeMesh::CoordType(x, y, 0);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::AddVertex(*this, p, n);
|
|
|
|
x++;
|
|
|
|
if (x > desiredWidth) {
|
|
|
|
x = 0;
|
|
|
|
y++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (size_t vi = 0; vi < VN(); vi++) {
|
|
|
|
int x = vi % (desiredWidth + 1);
|
|
|
|
int y = vi / (desiredWidth + 1);
|
|
|
|
const bool isCornerNode = (y == 0 && x == 0) ||
|
|
|
|
(y == 0 && x == desiredWidth) ||
|
|
|
|
(y == desiredHeight && x == 0) ||
|
|
|
|
(y == desiredHeight && x == desiredWidth);
|
|
|
|
if (isCornerNode) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (y == 0) { // row 0.Connect with node above
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi,
|
|
|
|
vi + desiredWidth + 1);
|
|
|
|
continue;
|
|
|
|
} else if (x == 0) { // col 0.Connect with node to the right
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi, vi + 1);
|
|
|
|
continue;
|
|
|
|
} else if (y == desiredHeight) { // row 0.Connect with node below
|
|
|
|
// vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi,
|
|
|
|
// vi - (desiredWidth +
|
|
|
|
// 1));
|
|
|
|
continue;
|
|
|
|
} else if (x == desiredWidth) { // row 0.Connect with node to the left
|
|
|
|
// vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi, vi - 1);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi, vi + desiredWidth + 1);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi, vi + 1);
|
|
|
|
// vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi,
|
|
|
|
// vi - (desiredWidth + 1));
|
|
|
|
// vcg::tri::Allocator<VCGEdgeMesh>::AddEdge(*this, vi, vi - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::DeleteVertex(*this, vert[0]);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::DeleteVertex(*this, vert[desiredWidth]);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::DeleteVertex(
|
|
|
|
*this, vert[desiredHeight * (desiredWidth + 1)]);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::DeleteVertex(
|
|
|
|
*this, vert[(desiredHeight + 1) * (desiredWidth + 1) - 1]);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactVertexVector(*this);
|
|
|
|
getEdges(eigenEdges);
|
|
|
|
getVertices(eigenVertices);
|
|
|
|
// vcg::tri::Allocator<VCGEdgeMesh>::CompactEdgeVector(*this);
|
|
|
|
|
|
|
|
// const size_t numberOfEdges =
|
|
|
|
// desiredHeight * (desiredWidth - 1) + desiredWidth * (desiredHeight -
|
|
|
|
// 1);
|
|
|
|
// handleBeamDimensions._handle->data.resize(
|
|
|
|
// numberOfEdges, CylindricalElementDimensions(0.03, 0.026));
|
|
|
|
// handleBeamMaterial._handle->data.resize(numberOfEdges,
|
|
|
|
// ElementMaterial(0.3, 200));
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-03-15 18:04:29 +01:00
|
|
|
bool VCGEdgeMesh::load(const string &plyFilename) {
|
2021-01-04 13:30:22 +01:00
|
|
|
|
2020-11-27 11:47:21 +01:00
|
|
|
std::string usedPath = plyFilename;
|
|
|
|
if (std::filesystem::path(plyFilename).is_relative()) {
|
|
|
|
usedPath = std::filesystem::absolute(plyFilename).string();
|
|
|
|
}
|
|
|
|
assert(std::filesystem::exists(usedPath));
|
|
|
|
this->Clear();
|
2021-11-15 10:08:39 +01:00
|
|
|
// if (!loadUsingNanoply(usedPath)) {
|
|
|
|
// std::cerr << "Error: Unable to open " + usedPath << std::endl;
|
|
|
|
// return false;
|
|
|
|
// }
|
|
|
|
if (!loadUsingDefaultLoader(usedPath)) {
|
|
|
|
std::cerr << "Error: Unable to open " + usedPath << std::endl;
|
|
|
|
return false;
|
2021-03-01 14:44:35 +01:00
|
|
|
}
|
2021-02-04 13:58:41 +01:00
|
|
|
|
2020-11-27 11:47:21 +01:00
|
|
|
getEdges(eigenEdges);
|
|
|
|
getVertices(eigenVertices);
|
|
|
|
vcg::tri::UpdateTopology<VCGEdgeMesh>::VertexEdge(*this);
|
2021-01-04 13:30:22 +01:00
|
|
|
label = std::filesystem::path(plyFilename).stem().string();
|
2020-11-27 11:47:21 +01:00
|
|
|
|
2021-03-01 14:44:35 +01:00
|
|
|
const bool printDebugInfo = false;
|
|
|
|
if (printDebugInfo) {
|
|
|
|
std::cout << plyFilename << " was loaded successfuly." << std::endl;
|
|
|
|
std::cout << "Mesh has " << EN() << " edges." << std::endl;
|
|
|
|
}
|
2021-04-08 20:03:23 +02:00
|
|
|
|
2021-05-01 17:44:54 +02:00
|
|
|
label=std::filesystem::path(plyFilename).stem().string();
|
2020-11-27 11:47:21 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-11-15 10:08:39 +01:00
|
|
|
//bool VCGEdgeMesh::loadUsingNanoply(const std::string &plyFilename) {
|
|
|
|
|
|
|
|
// this->Clear();
|
|
|
|
// // assert(plyFileHasAllRequiredFields(plyFilename));
|
|
|
|
// // Load the ply file
|
|
|
|
// unsigned int mask = 0;
|
|
|
|
// mask |= nanoply::NanoPlyWrapper<VCGEdgeMesh>::IO_VERTCOORD;
|
|
|
|
// mask |= nanoply::NanoPlyWrapper<VCGEdgeMesh>::IO_VERTNORMAL;
|
|
|
|
// mask |= nanoply::NanoPlyWrapper<VCGEdgeMesh>::IO_VERTCOLOR;
|
|
|
|
// mask |= nanoply::NanoPlyWrapper<VCGEdgeMesh>::IO_EDGEINDEX;
|
|
|
|
// if (nanoply::NanoPlyWrapper<VCGEdgeMesh>::LoadModel(plyFilename.c_str(),
|
|
|
|
// *this, mask) != 0) {
|
|
|
|
// return false;
|
|
|
|
// }
|
|
|
|
// return true;
|
|
|
|
//}
|
|
|
|
|
|
|
|
bool VCGEdgeMesh::loadUsingDefaultLoader(const std::string &plyFilename)
|
|
|
|
{
|
|
|
|
this->Clear();
|
|
|
|
// assert(plyFileHasAllRequiredFields(plyFilename));
|
|
|
|
// Load the ply file
|
|
|
|
int mask = 0;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTCOORD;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTNORMAL;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_VERTCOLOR;
|
|
|
|
mask |= vcg::tri::io::Mask::IOM_EDGEINDEX;
|
|
|
|
// if (nanoply::NanoPlyWrapper<VCGEdgeMesh>::LoadModel(plyFilename.c_str(),
|
|
|
|
// *this, mask) != 0) {
|
|
|
|
if (vcg::tri::io::Importer<VCGEdgeMesh>::Open(*this, plyFilename.c_str(), mask) != 0) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
|
2021-03-15 18:04:29 +01:00
|
|
|
// bool VCGEdgeMesh::plyFileHasAllRequiredFields(const std::string
|
|
|
|
// &plyFilename)
|
2020-12-03 19:56:03 +01:00
|
|
|
// {
|
|
|
|
// const nanoply::Info info(plyFilename);
|
|
|
|
// const std::vector<nanoply::PlyElement>::const_iterator edgeElemIt =
|
|
|
|
// std::find_if(info.elemVec.begin(), info.elemVec.end(),
|
|
|
|
// [&](const nanoply::PlyElement &plyElem) {
|
|
|
|
// return plyElem.plyElem == nanoply::NNP_EDGE_ELEM;
|
|
|
|
// });
|
|
|
|
// if (edgeElemIt == info.elemVec.end()) {
|
|
|
|
// std::cerr << "Ply file is missing edge elements." << std::endl;
|
|
|
|
// return false;
|
|
|
|
// }
|
|
|
|
|
|
|
|
// const std::vector<nanoply::PlyProperty> &edgePropertyVector =
|
|
|
|
// edgeElemIt->propVec;
|
|
|
|
// return hasPlyEdgeProperty(plyFilename, edgePropertyVector,
|
|
|
|
// plyPropertyBeamDimensionsID) &&
|
|
|
|
// hasPlyEdgeProperty(plyFilename, edgePropertyVector,
|
|
|
|
// plyPropertyBeamMaterialID);
|
|
|
|
//}
|
2020-11-27 11:47:21 +01:00
|
|
|
|
|
|
|
Eigen::MatrixX3d VCGEdgeMesh::getNormals() const {
|
|
|
|
Eigen::MatrixX3d vertexNormals;
|
|
|
|
vertexNormals.resize(VN(), 3);
|
|
|
|
|
|
|
|
for (int vertexIndex = 0; vertexIndex < VN(); vertexIndex++) {
|
|
|
|
VCGEdgeMesh::CoordType vertexNormal =
|
|
|
|
vert[static_cast<size_t>(vertexIndex)].cN();
|
|
|
|
vertexNormals.row(vertexIndex) =
|
|
|
|
vertexNormal.ToEigenVector<Eigen::Vector3d>();
|
|
|
|
}
|
|
|
|
|
|
|
|
return vertexNormals;
|
|
|
|
}
|
|
|
|
void VCGEdgeMesh::getEdges(Eigen::MatrixX3d &edgeStartingPoints,
|
|
|
|
Eigen::MatrixX3d &edgeEndingPoints) const {
|
|
|
|
edgeStartingPoints.resize(EN(), 3);
|
|
|
|
edgeEndingPoints.resize(EN(), 3);
|
|
|
|
for (int edgeIndex = 0; edgeIndex < EN(); edgeIndex++) {
|
|
|
|
const VCGEdgeMesh::EdgeType &edge = this->edge[edgeIndex];
|
|
|
|
edgeStartingPoints.row(edgeIndex) =
|
|
|
|
edge.cP(0).ToEigenVector<Eigen::Vector3d>();
|
|
|
|
edgeEndingPoints.row(edgeIndex) =
|
|
|
|
edge.cP(1).ToEigenVector<Eigen::Vector3d>();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-12-03 19:56:03 +01:00
|
|
|
VCGEdgeMesh::VCGEdgeMesh() {}
|
2020-11-27 11:47:21 +01:00
|
|
|
|
|
|
|
void VCGEdgeMesh::updateEigenEdgeAndVertices() {
|
2021-03-15 18:04:29 +01:00
|
|
|
#ifdef POLYSCOPE_DEFINED
|
2020-11-27 11:47:21 +01:00
|
|
|
getEdges(eigenEdges);
|
|
|
|
getVertices(eigenVertices);
|
2021-03-15 18:04:29 +01:00
|
|
|
#endif
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
|
2021-04-08 20:03:23 +02:00
|
|
|
bool VCGEdgeMesh::copy(VCGEdgeMesh &mesh) {
|
2020-11-27 11:47:21 +01:00
|
|
|
vcg::tri::Append<VCGEdgeMesh, VCGEdgeMesh>::MeshCopy(*this, mesh);
|
|
|
|
label = mesh.getLabel();
|
|
|
|
eigenEdges = mesh.getEigenEdges();
|
|
|
|
if (eigenEdges.rows() == 0) {
|
|
|
|
getEdges(eigenEdges);
|
|
|
|
}
|
|
|
|
eigenVertices = mesh.getEigenVertices();
|
|
|
|
if (eigenVertices.rows() == 0) {
|
|
|
|
getVertices(eigenVertices);
|
|
|
|
}
|
|
|
|
vcg::tri::UpdateTopology<VCGEdgeMesh>::VertexEdge(*this);
|
2021-04-08 20:03:23 +02:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-04-30 12:13:58 +02:00
|
|
|
void VCGEdgeMesh::removeDuplicateVertices()
|
|
|
|
{
|
2021-04-08 20:03:23 +02:00
|
|
|
vcg::tri::Clean<VCGEdgeMesh>::MergeCloseVertex(*this, 0.000061524);
|
2021-04-30 12:13:58 +02:00
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactVertexVector(*this);
|
|
|
|
vcg::tri::UpdateTopology<VCGEdgeMesh>::VertexEdge(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::removeDuplicateVertices(
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::PointerUpdater<VertexPointer> &pu_vertices,
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::PointerUpdater<EdgePointer> &pu_edges)
|
|
|
|
{
|
|
|
|
vcg::tri::Clean<VCGEdgeMesh>::MergeCloseVertex(*this, 0.000061524);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactVertexVector(*this, pu_vertices);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactEdgeVector(*this, pu_edges);
|
2021-04-08 20:03:23 +02:00
|
|
|
vcg::tri::UpdateTopology<VCGEdgeMesh>::VertexEdge(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::deleteDanglingVertices() {
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::PointerUpdater<VertexPointer> pu;
|
|
|
|
deleteDanglingVertices(pu);
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::deleteDanglingVertices(vcg::tri::Allocator<VCGEdgeMesh>::PointerUpdater<TriMesh::VertexPointer> &pu) {
|
|
|
|
for (VertexType &v : vert) {
|
|
|
|
std::vector<VCGEdgeMesh::EdgePointer> incidentElements;
|
|
|
|
vcg::edge::VEStarVE(&v, incidentElements);
|
|
|
|
if (incidentElements.size() == 0 && !v.IsD()) {
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::DeleteVertex(*this, v);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactVertexVector(*this, pu);
|
|
|
|
vcg::tri::Allocator<VCGEdgeMesh>::CompactEdgeVector(*this);
|
|
|
|
|
|
|
|
updateEigenEdgeAndVertices();
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::getVertices(Eigen::MatrixX3d &vertices) {
|
2021-04-08 20:03:23 +02:00
|
|
|
vertices = Eigen::MatrixX3d();
|
|
|
|
vertices.resize(VN(), 3);
|
|
|
|
for (int vi = 0; vi < VN(); vi++) {
|
|
|
|
if (vert[vi].IsD()) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
VCGEdgeMesh::CoordType vertexCoordinates =
|
|
|
|
vert[static_cast<size_t>(vi)].cP();
|
|
|
|
vertices.row(vi) = vertexCoordinates.ToEigenVector<Eigen::Vector3d>();
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::getEdges(Eigen::MatrixX2i &edges) {
|
|
|
|
edges = Eigen::MatrixX2i();
|
|
|
|
edges.resize(EN(), 2);
|
|
|
|
for (int edgeIndex = 0; edgeIndex < EN(); edgeIndex++) {
|
|
|
|
const VCGEdgeMesh::EdgeType &edge = this->edge[edgeIndex];
|
2021-03-15 18:04:29 +01:00
|
|
|
assert(!edge.IsD());
|
|
|
|
auto vp0 = edge.cV(0);
|
|
|
|
auto vp1 = edge.cV(1);
|
|
|
|
assert(vcg::tri::IsValidPointer(*this, vp0) &&
|
|
|
|
vcg::tri::IsValidPointer(*this, vp1));
|
|
|
|
const size_t vi0 = vcg::tri::Index<VCGEdgeMesh>(*this, vp0);
|
|
|
|
const size_t vi1 = vcg::tri::Index<VCGEdgeMesh>(*this, vp1);
|
|
|
|
assert(vi0 != -1 && vi1 != -1);
|
|
|
|
edges.row(edgeIndex) = Eigen::Vector2i(vi0, vi1);
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::printVertexCoordinates(const size_t &vi) const {
|
|
|
|
std::cout << "vi:" << vi << " " << vert[vi].cP()[0] << " " << vert[vi].cP()[1]
|
|
|
|
<< " " << vert[vi].cP()[2] << std::endl;
|
|
|
|
}
|
|
|
|
|
2021-03-01 14:44:35 +01:00
|
|
|
#ifdef POLYSCOPE_DEFINED
|
2021-04-08 20:03:23 +02:00
|
|
|
//TODO: make const getEigenVertices is not
|
|
|
|
polyscope::CurveNetwork *VCGEdgeMesh::registerForDrawing(
|
2021-07-28 17:38:05 +02:00
|
|
|
const std::optional<std::array<double, 3>> &desiredColor,
|
|
|
|
const double &desiredRadius,
|
|
|
|
const bool &shouldEnable)
|
2021-04-08 20:03:23 +02:00
|
|
|
{
|
2021-04-30 12:13:58 +02:00
|
|
|
PolyscopeInterface::init();
|
2021-07-28 17:38:05 +02:00
|
|
|
const double drawingRadius = desiredRadius;
|
2021-04-30 12:13:58 +02:00
|
|
|
polyscope::CurveNetwork *polyscopeHandle_edgeMesh
|
|
|
|
= polyscope::registerCurveNetwork(label, getEigenVertices(), getEigenEdges());
|
2021-04-08 20:03:23 +02:00
|
|
|
|
|
|
|
polyscopeHandle_edgeMesh->setEnabled(shouldEnable);
|
|
|
|
polyscopeHandle_edgeMesh->setRadius(drawingRadius, true);
|
|
|
|
if (desiredColor.has_value()) {
|
|
|
|
const glm::vec3 desiredColor_glm(desiredColor.value()[0],
|
|
|
|
desiredColor.value()[1],
|
|
|
|
desiredColor.value()[2]);
|
|
|
|
polyscopeHandle_edgeMesh->setColor(desiredColor_glm);
|
|
|
|
}
|
|
|
|
|
|
|
|
return polyscopeHandle_edgeMesh;
|
2021-03-01 14:44:35 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void VCGEdgeMesh::unregister() const {
|
|
|
|
if (!polyscope::hasCurveNetwork(label)) {
|
|
|
|
std::cerr << "No curve network registered with a name: " << getLabel()
|
|
|
|
<< std::endl;
|
|
|
|
std::cerr << "Nothing to remove." << std::endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
polyscope::removeCurveNetwork(label);
|
2020-11-27 11:47:21 +01:00
|
|
|
}
|
2021-04-08 20:03:23 +02:00
|
|
|
|
|
|
|
void VCGEdgeMesh::drawInitialFrames(polyscope::CurveNetwork *polyscopeHandle_initialMesh) const
|
|
|
|
{
|
|
|
|
Eigen::MatrixX3d frameInitialX(VN(), 3);
|
|
|
|
Eigen::MatrixX3d frameInitialY(VN(), 3);
|
|
|
|
Eigen::MatrixX3d frameInitialZ(VN(), 3);
|
|
|
|
for (int vi = 0; vi < VN(); vi++) {
|
|
|
|
frameInitialX.row(vi) = Eigen::Vector3d(1, 0, 0);
|
|
|
|
frameInitialY.row(vi) = Eigen::Vector3d(0, 1, 0);
|
|
|
|
frameInitialZ.row(vi) = Eigen::Vector3d(0, 0, 1);
|
|
|
|
}
|
|
|
|
polyscopeHandle_initialMesh->addNodeVectorQuantity("FrameX", frameInitialX)
|
|
|
|
->setVectorColor(glm::vec3(1, 0, 0))
|
|
|
|
->setEnabled(true);
|
|
|
|
polyscopeHandle_initialMesh->addNodeVectorQuantity("FrameY", frameInitialY)
|
|
|
|
->setVectorColor(glm::vec3(0, 1, 0))
|
|
|
|
->setEnabled(true);
|
|
|
|
polyscopeHandle_initialMesh->addNodeVectorQuantity("FrameZ", frameInitialZ)
|
|
|
|
->setVectorColor(glm::vec3(0, 0, 1))
|
|
|
|
->setEnabled(true);
|
|
|
|
}
|
2021-03-01 14:44:35 +01:00
|
|
|
#endif
|