void GeometryCorrectionTable::apply_correction_to_in_plane_edge( const Vector3F& edge_dir, MatrixFr& loop) { VectorF bbox_min = loop.colwise().minCoeff(); VectorF bbox_max = loop.colwise().maxCoeff(); VectorF bbox_center = 0.5 * (bbox_min + bbox_max); size_t num_vts = loop.rows(); size_t dim = loop.cols(); assert(dim == 3); MatrixFr proj_loop(num_vts, dim); for (size_t i=0; i<num_vts; i++) { const VectorF& v = loop.row(i) - bbox_center.transpose(); proj_loop.row(i) = Vector3F(v[0], v[1], 0.0); } Float target_half_height = 1e3; // Something huge to represent inf Float target_half_width = proj_loop.row(0).norm(); Vector2F correction_1 = lookup(target_half_width, target_half_height); Vector2F correction_2 = lookup(target_half_height, target_half_width); Float half_width = 0.5 * (correction_1[0] + correction_2[1]) + 0.05 * num_offset_pixel; half_width = std::max(half_width, min_thickness); for (size_t i=0; i<num_vts; i++) { loop.row(i) += proj_loop.row(i) * (-target_half_width + half_width) / target_half_width; } }
void GeometryCorrectionTable::apply_z_correction( const Vector3F& edge_dir, MatrixFr& loop) { //const Float max_z_error = 0.125; //const Float max_z_error = 0.09; const Float max_z_error = 0.00; VectorF bbox_min = loop.colwise().minCoeff(); VectorF bbox_max = loop.colwise().maxCoeff(); VectorF bbox_center = 0.5 * (bbox_min + bbox_max); Vector3F side_dir = edge_dir.cross(Vector3F::UnitZ()); Float sin_val = side_dir.norm(); if (sin_val < 1e-3) return; const size_t num_vts = loop.rows(); for (size_t i=0; i<num_vts; i++) { Vector3F v = loop.row(i) - bbox_center.transpose(); Float side_component = side_dir.dot(v) / sin_val; Vector3F proj_v = v - side_component * side_dir / sin_val; Float proj_component = proj_v.norm(); if (proj_component > 1e-3) { proj_v -= proj_v / proj_component * (sin_val * max_z_error); } loop.row(i) = bbox_center + proj_v + side_component * side_dir / sin_val; } }
void SimpleInflator::generate_joint( const MatrixFr& pts, const VectorI& source_ids, size_t vertex_index) { const size_t dim = m_wire_network->get_dim(); ConvexHullEngine::Ptr convex_hull = ConvexHullEngine::create(dim, "qhull"); convex_hull->run(pts); MatrixFr vertices = convex_hull->get_vertices(); MatrixIr faces = convex_hull->get_faces(); VectorI index_map = convex_hull->get_index_map(); if (dim == 2) { // Need to triangulate the loop. const size_t num_vertices = vertices.rows(); TriangleWrapper tri(vertices, faces); tri.run(std::numeric_limits<Float>::max(), false, false, false); vertices = tri.get_vertices(); faces = tri.get_faces(); assert(vertices.rows() == num_vertices); } m_vertex_list.push_back(vertices); const size_t num_faces = faces.rows(); for (size_t i=0; i<num_faces; i++) { const auto& face = faces.row(i); if (dim == 3) { auto ori_indices = map_indices(face, index_map); if (belong_to_the_same_loop(ori_indices, source_ids)) continue; } m_face_list.push_back(face.array() + m_num_vertex_accumulated); m_face_source_list.push_back(vertex_index+1); } m_num_vertex_accumulated += vertices.rows(); }
SelfIntersection::SelfIntersection( const MatrixFr& vertices, const MatrixIr& faces) : m_faces(faces) { const size_t num_vertices = vertices.rows(); const size_t dim = vertices.cols(); const size_t num_faces = faces.rows(); const size_t vertex_per_face = faces.cols(); if (dim != 3) { throw NotImplementedError( "Self intersection check only support 3D"); } if (vertex_per_face != 3) { throw NotImplementedError( "Self intersection check only works with triangles"); } m_points.resize(num_vertices); for (size_t i=0; i<num_vertices; i++) { m_points[i] = Point_3( vertices(i,0), vertices(i,1), vertices(i,2)); } }
void SimpleInflator::generate_end_loops() { const size_t num_edges = m_wire_network->get_num_edges(); const MatrixFr vertices = m_wire_network->get_vertices(); const MatrixIr edges = m_wire_network->get_edges(); const MatrixFr edge_thickness = get_edge_thickness(); for (size_t i=0; i<num_edges; i++) { const VectorI& edge = edges.row(i); const VectorF& v1 = vertices.row(edge[0]); const VectorF& v2 = vertices.row(edge[1]); Float edge_len = (v2 - v1).norm(); MatrixFr loop_1 = m_profile->place(v1, v2, m_end_loop_offsets[edge[0]], edge_thickness(i, 0), m_rel_correction, m_abs_correction, m_correction_cap, m_spread_const); assert(loop_is_valid(loop_1, v1, v2)); MatrixFr loop_2 = m_profile->place(v1, v2, edge_len - m_end_loop_offsets[edge[1]], edge_thickness(i, 1), m_rel_correction, m_abs_correction, m_correction_cap, m_spread_const); assert(loop_is_valid(loop_2, v1, v2)); m_end_loops.push_back(std::make_pair(loop_1, loop_2)); } }
GeoMeshPtr GeogramMeshUtils::wire_network_to_geomesh( const MatrixFr& vertices, const Matrix2Ir& edges) { const size_t dim = vertices.cols(); const size_t num_vertices = vertices.rows(); const size_t num_edges = edges.rows(); auto geo_mesh = std::make_shared<GeoMesh>(dim, false); geo_mesh->vertices.clear(); geo_mesh->vertices.create_vertices(num_vertices); geo_mesh->edges.clear(); geo_mesh->edges.create_edges(num_edges); for (size_t i=0; i<num_vertices; i++) { auto& p = geo_mesh->vertices.point(i); for (size_t j=0; j<dim; j++) { p[j] = vertices(i,j); } } for (size_t i=0; i<num_edges; i++) { geo_mesh->edges.set_vertex(i, 0, edges(i,0)); geo_mesh->edges.set_vertex(i, 1, edges(i,1)); } return geo_mesh; }
GeoMeshPtr GeogramMeshUtils::raw_to_geomesh( const MatrixFr& vertices, const MatrixIr& faces) { const size_t dim = vertices.cols(); const size_t vertex_per_face = faces.cols(); const size_t num_vertices = vertices.rows(); const size_t num_faces = faces.rows(); if (vertex_per_face != 3) { throw NotImplementedError("Converting non-triangle mesh to " "Geogram mesh is not yet implemented"); } auto geo_mesh = std::make_shared<GeoMesh>(dim, false); geo_mesh->vertices.clear(); geo_mesh->vertices.create_vertices(num_vertices); geo_mesh->facets.clear(); geo_mesh->facets.create_triangles(num_faces); for (size_t i=0; i<num_vertices; i++) { auto& p = geo_mesh->vertices.point(i); for (size_t j=0; j<dim; j++) { p[j] = vertices(i,j); } } for (size_t i=0; i<num_faces; i++) { geo_mesh->facets.set_vertex(i, 0, faces(i,0)); geo_mesh->facets.set_vertex(i, 1, faces(i,1)); geo_mesh->facets.set_vertex(i, 2, faces(i,2)); } return geo_mesh; }
CarveMeshPtr create_mesh(const MatrixFr& vertices, const MatrixIr& faces) { const size_t num_vertices = vertices.rows(); const size_t num_faces = faces.rows(); if (vertices.cols() != 3) { throw NotImplementedError("Only 3D mesh is supported."); } if (faces.cols() != 3) { throw NotImplementedError("Only triangle mesh is supported."); } std::vector<CarveVector> points; for (size_t i=0; i<num_vertices; i++) { const auto& v = vertices.row(i); CarveVector p; p.v[0] = v[0]; p.v[1] = v[1]; p.v[2] = v[2]; points.push_back(p); } std::vector<int> raw_faces; raw_faces.reserve(num_faces * 4); for (size_t i=0; i<num_faces; i++) { raw_faces.push_back(3); raw_faces.push_back(faces(i,0)); raw_faces.push_back(faces(i,1)); raw_faces.push_back(faces(i,2)); } return CarveMeshPtr(new CarveMesh(points, num_faces, raw_faces)); }
void TilerEngine::remove_duplicated_vertices(WireNetwork& wire_network, Float tol) { const size_t num_input_vertices = wire_network.get_num_vertices(); DuplicatedVertexRemoval remover(wire_network.get_vertices(), wire_network.get_edges()); remover.run(tol); MatrixFr vertices = remover.get_vertices(); MatrixIr edges = remover.get_faces(); VectorI index_map = remover.get_index_map(); assert(num_input_vertices == index_map.size()); wire_network.set_vertices(vertices); wire_network.set_edges(edges); const size_t num_output_vertices = wire_network.get_num_vertices(); std::vector<std::string> attr_names = wire_network.get_attribute_names(); for (auto itr : attr_names) { const std::string& name = itr; if (wire_network.is_vertex_attribute(name)) { MatrixFr values = wire_network.get_attribute(name); MatrixFr updated_values = MatrixFr::Zero(num_output_vertices, values.cols()); VectorF count = VectorF::Zero(num_output_vertices); for (size_t i=0; i<num_input_vertices; i++) { size_t j = index_map[i]; updated_values.row(j) += values.row(i); count[j] += 1; } for (size_t i=0; i<num_output_vertices; i++) { assert(count[i] > 0); updated_values.row(i) /= count[i]; } wire_network.set_attribute(name, updated_values); } } }
HashGrid::Ptr compute_vertex_grid(const MatrixFr& vertices, Float cell_size) { const size_t dim = vertices.cols(); const size_t num_vertices = vertices.rows(); HashGrid::Ptr grid = HashGrid::create(cell_size, dim); for (size_t i=0; i<num_vertices; i++) { const VectorF& v = vertices.row(i); grid->insert(i, v); } return grid; }
void extract_mesh(const C3t3& c3t3, MatrixFr& vertices, MatrixIr& faces, MatrixIr& voxels) { const Tr& tr = c3t3.triangulation(); size_t num_vertices = tr.number_of_vertices(); size_t num_faces = c3t3.number_of_facets_in_complex(); size_t num_voxels = c3t3.number_of_cells_in_complex(); vertices.resize(num_vertices, 3); faces.resize(num_faces, 3); voxels.resize(num_voxels, 4); std::map<Tr::Vertex_handle, int> V; size_t inum = 0; for(auto vit = tr.finite_vertices_begin(); vit != tr.finite_vertices_end(); ++vit) { V[vit] = inum; const auto& p = vit->point(); vertices.row(inum) = Vector3F(p.x(), p.y(), p.z()).transpose(); assert(inum < num_vertices); inum++; } assert(inum == num_vertices); size_t face_count = 0; for(auto fit = c3t3.facets_in_complex_begin(); fit != c3t3.facets_in_complex_end(); ++fit) { assert(face_count < num_faces); for (int i=0; i<3; i++) { if (i != fit->second) { const auto& vh = (*fit).first->vertex(i); assert(V.find(vh) != V.end()); const int vid = V[vh]; faces(face_count, i) = vid; } } face_count++; } assert(face_count == num_faces); size_t voxel_count = 0; for(auto cit = c3t3.cells_in_complex_begin() ; cit != c3t3.cells_in_complex_end(); ++cit ) { assert(voxel_count < num_voxels); for (int i=0; i<4; i++) { assert(V.find(cit->vertex(i)) != V.end()); const size_t vid = V[cit->vertex(i)]; voxels(voxel_count, i) = vid; } voxel_count++; } assert(voxel_count == num_voxels); }
void CGALConvexHull3D::run(const MatrixFr& points) { std::list<Point_3> cgal_pts; const size_t num_pts = points.rows(); const size_t dim = points.cols(); if (dim != 3) { std::stringstream err_msg; err_msg << "Invalid dim: " << dim << " Expect dim=3."; throw RuntimeError(err_msg.str()); } for (size_t i=0; i<num_pts; i++) { const VectorF& p = points.row(i); cgal_pts.push_back(Point_3(p[0], p[1], p[2])); } Polyhedron_3 hull; CGAL::convex_hull_3(cgal_pts.begin(), cgal_pts.end(), hull); assert(hull.is_closed()); assert(hull.is_pure_triangle()); const size_t num_vertices = hull.size_of_vertices(); const size_t num_faces = hull.size_of_facets(); m_vertices.resize(num_vertices, dim); m_faces.resize(num_faces, 3); size_t vertex_count=0; for (auto itr=hull.vertices_begin(); itr!=hull.vertices_end(); itr++) { const Point_3& p = itr->point(); m_vertices.coeffRef(vertex_count, 0) = p.x(); m_vertices.coeffRef(vertex_count, 1) = p.y(); m_vertices.coeffRef(vertex_count, 2) = p.z(); itr->id() = vertex_count; vertex_count++; } size_t face_count=0; for (auto f_itr=hull.facets_begin(); f_itr!=hull.facets_end(); f_itr++) { size_t edge_count=0; auto h_itr = f_itr->facet_begin(); do { m_faces.coeffRef(face_count, edge_count) = h_itr->vertex()->id(); edge_count++; h_itr++; } while (h_itr != f_itr->facet_begin()); face_count++; } compute_index_map(points); reorient_faces(); }
Boundary::Ptr Boundary::extract_surface_boundary_raw( MatrixFr& vertices, MatrixIr& faces) { VectorF flattened_vertices = Eigen::Map<VectorF>(vertices.data(), vertices.rows() * vertices.cols()); VectorI flattened_faces = Eigen::Map<VectorI>(faces.data(), faces.rows() * faces.cols()); VectorI voxels = VectorI::Zero(0); MeshFactory factory; Mesh::Ptr mesh = factory.load_data(flattened_vertices, flattened_faces, voxels, vertices.cols(), faces.cols(), 0).create(); return extract_surface_boundary(*mesh); }
void reorientate_triangles(const MatrixFr& vertices, MatrixIr& faces, const VectorF& n) { assert(vertices.cols() == 3); assert(faces.cols() == 3); const VectorI& f = faces.row(0); const Vector3F& v0 = vertices.row(f[0]); const Vector3F& v1 = vertices.row(f[1]); const Vector3F& v2 = vertices.row(f[2]); Float projected_area = (v1-v0).cross(v2-v0).dot(n); if (projected_area < 0) { faces.col(2).swap(faces.col(1)); } }
VectorF FastWindingNumberEngine::run(const MatrixFr& queries) { const auto num_vertices = m_vertices.rows(); const auto num_faces = m_faces.rows(); const auto num_queries = queries.rows(); using Vector = HDK_Sample::UT_Vector3T<float>; using Engine = HDK_Sample::UT_SolidAngle<float, float>; std::vector<Vector> vertices(num_vertices); for (size_t i=0; i<num_vertices; i++) { vertices[i][0] = static_cast<float>(m_vertices(i, 0)); vertices[i][1] = static_cast<float>(m_vertices(i, 1)); vertices[i][2] = static_cast<float>(m_vertices(i, 2)); } Engine engine; engine.init(num_faces, m_faces.data(), num_vertices, vertices.data()); VectorF winding_numbers(num_queries); for (size_t i=0; i<num_queries; i++) { Vector q; q[0] = static_cast<float>(queries(i, 0)); q[1] = static_cast<float>(queries(i, 1)); q[2] = static_cast<float>(queries(i, 2)); winding_numbers[i] = engine.computeSolidAngle(q); } winding_numbers /= 4 * M_PI; return winding_numbers; }
void extract_data(CarveMeshPtr mesh, MatrixFr& vertices, MatrixIr& faces) { typedef CarveMesh::vertex_t CarveVertex; const size_t num_vertices = mesh->vertex_storage.size(); vertices.resize(num_vertices, 3); for (size_t i=0; i<num_vertices; i++) { const auto& v = mesh->vertex_storage[i]; vertices(i,0) = v.v.x; vertices(i,1) = v.v.y; vertices(i,2) = v.v.z; } const size_t num_faces = mesh->faceEnd() - mesh->faceBegin(); faces.resize(num_faces, 3); for (auto itr=mesh->faceBegin(); itr != mesh->faceEnd(); itr++) { std::vector<CarveVertex* > vts; (*itr)->getVertices(vts); assert(vts.size() == 3); // WARNING: // Here is my guess on how to extract vertex index. // Carve's documentation is not clear on how to do this. const size_t fid = itr - mesh->faceBegin(); faces(fid, 0) = vts[0] - &mesh->vertex_storage[0]; faces(fid, 1) = vts[1] - &mesh->vertex_storage[0]; faces(fid, 2) = vts[2] - &mesh->vertex_storage[0]; } }
void create_box(const VectorF& bbox_min, const VectorF& bbox_max, MatrixFr& box_vertices, MatrixIr& box_faces) { box_vertices.resize(8, 3); box_faces.resize(12, 3); box_vertices << bbox_min[0], bbox_min[1], bbox_min[2], bbox_max[0], bbox_min[1], bbox_min[2], bbox_max[0], bbox_max[1], bbox_min[2], bbox_min[0], bbox_max[1], bbox_min[2], bbox_min[0], bbox_min[1], bbox_max[2], bbox_max[0], bbox_min[1], bbox_max[2], bbox_max[0], bbox_max[1], bbox_max[2], bbox_min[0], bbox_max[1], bbox_max[2]; box_faces << 1, 2, 5, 5, 2, 6, 3, 4, 7, 3, 0, 4, 2, 3, 6, 3, 7, 6, 0, 1, 5, 0, 5, 4, 4, 5, 6, 4, 6, 7, 0, 3, 2, 0, 2, 1; }
void VertexIsotropicOffsetParameter::process_roi() { const size_t dim = m_wire_network->get_dim(); MatrixFr vertices = m_wire_network->get_vertices(); VectorF center = m_wire_network->center(); m_transforms.clear(); IsotropicTransforms iso_trans(dim); size_t roi_size = m_roi.size(); size_t seed_vertex_index = m_roi.minCoeff(); VectorF seed_dir = vertices.row(seed_vertex_index).transpose() - center; for (size_t i=0; i<roi_size; i++) { VectorF v_dir = vertices.row(m_roi[i]).transpose() - center; MatrixF trans = iso_trans.fit(seed_dir, v_dir); m_transforms.push_back(trans); } }
WireNetwork::Ptr MixedMeshTiler::tile() { const size_t num_cells = get_num_cells(); auto transforms = get_tiling_operators(); auto vars_array = extract_attributes(m_mesh); VectorI pattern_id = m_mesh->get_attribute("pattern_id").cast<int>(); assert(pattern_id.size() == num_cells); m_tiled_vertices.clear(); m_tiled_edges.clear(); m_tiled_thicknesses.clear(); m_tiled_offsets.clear(); size_t v_count = 0; auto transform_itr = transforms.begin(); for (size_t i=0; i<num_cells; i++) { set_active_wire_network(pattern_id[i]); scale_to_unit_box(); append_vertices(*transform_itr); append_edges(v_count); append_thicknesses(vars_array[i]); append_offsets(vars_array[i], *transform_itr); v_count += m_unit_wire_network->get_num_vertices(); transform_itr++; } MatrixFr vertices = vstack(m_tiled_vertices); MatrixIr edges = vstack(m_tiled_edges); MatrixFr thicknesses = vstack(m_tiled_thicknesses); MatrixFr offsets = vstack(m_tiled_offsets); assert(edges.minCoeff() >= 0); assert(edges.maxCoeff() < vertices.rows()); WireNetwork::Ptr tiled_network = WireNetwork::create_raw(vertices, edges); tiled_network->add_attribute("thickness", m_target_type == ParameterCommon::VERTEX); tiled_network->set_attribute("thickness", thicknesses); tiled_network->add_attribute("vertex_offset", true); tiled_network->set_attribute("vertex_offset", offsets); clean_up(*tiled_network); return tiled_network; }
Polyhedron generate_polyhedron( const MatrixFr& vertices, const MatrixIr& faces) { Polyhedron P; PolyhedronBuilder<HalfedgeDS> triangle(vertices, faces); P.delegate(triangle); assert(vertices.rows() == P.size_of_vertices()); assert(faces.rows() == P.size_of_facets()); return P; }
void PointLocator::locate(const MatrixFr& points) { const Float eps = 1e-6; const size_t num_pts = points.rows(); m_voxel_idx = VectorI::Zero(num_pts); m_barycentric_coords = MatrixFr::Zero(num_pts, m_vertex_per_element); for (size_t i=0; i<num_pts; i++) { VectorF v = points.row(i); VectorI candidate_elems = m_grid->get_items_near_point(v); VectorF barycentric_coord; VectorF best_barycentric_coord; bool found = false; Float least_negative_coordinate = -std::numeric_limits<Float>::max(); const size_t num_candidates = candidate_elems.size(); for (size_t j=0; j<num_candidates; j++) { barycentric_coord = compute_barycentric_coord( v, candidate_elems[j]); Float min_barycentric_coord = barycentric_coord.minCoeff(); if (min_barycentric_coord > least_negative_coordinate) { found = true; least_negative_coordinate = min_barycentric_coord; m_voxel_idx[i] = candidate_elems[j]; best_barycentric_coord = barycentric_coord; if (min_barycentric_coord >= -eps) { break; } } } if (!found) { std::stringstream err_msg; err_msg << "Point ( "; for (size_t i=0; i<m_mesh->get_dim(); i++) { err_msg << v[i] << " "; } err_msg << ") is not inside of any voxels" << std::endl; throw RuntimeError(err_msg.str()); } m_barycentric_coords.row(i) = best_barycentric_coord; } }
/** * Return true iff the projection of loop onto line (v0, v1) is completely * between v0 and v1. */ bool loop_is_valid(const MatrixFr& loop, const VectorF& v0, const VectorF& v1) { VectorF dir = v1 - v0; Float dir_sq_len = dir.squaredNorm(); if (dir_sq_len == 0.0) { throw RuntimeError("Zero edge encountered."); } VectorF proj = (loop.rowwise() - v0.transpose()) * dir / dir_sq_len; return ((proj.array() > 0.0).all() && (proj.array() < 1.0).all()); }
void save_mesh(const std::string& filename, const MatrixFr& vertices, const MatrixIr& faces) { auto flattened_vertices = MatrixUtils::flatten<VectorF>(vertices); auto flattened_faces = MatrixUtils::flatten<VectorI>(faces); VectorI voxels = VectorI::Zero(0); MeshWriter::Ptr writer = MeshWriter::create(filename); writer->write(flattened_vertices, flattened_faces, voxels, vertices.cols(), faces.cols(), 0); }
bool MeshValidation::is_periodic( const MatrixFr& vertices, const MatrixIr& faces) { const Float EPS = 1e-6; HashGrid::Ptr grid = compute_vertex_grid(vertices, EPS); Vector3F bbox_min = vertices.colwise().minCoeff(); Vector3F bbox_max = vertices.colwise().maxCoeff(); Vector3F bbox_size = bbox_max - bbox_min; Vector3F offsets[] = { Vector3F( bbox_size[0], 0.0, 0.0), Vector3F(-bbox_size[0], 0.0, 0.0), Vector3F(0.0, bbox_size[1], 0.0), Vector3F(0.0,-bbox_size[1], 0.0), Vector3F(0.0, 0.0, bbox_size[2]), Vector3F(0.0, 0.0,-bbox_size[2]) }; bool result = true; const size_t num_vertices = vertices.rows(); for (size_t i=0; i<num_vertices; i++) { const VectorF& v = vertices.row(i); if (fabs(v[0] - bbox_min[0]) < EPS) { result = result && match(grid, v + offsets[0]); } if (fabs(v[0] - bbox_max[0]) < EPS) { result = result && match(grid, v + offsets[1]); } if (fabs(v[1] - bbox_min[1]) < EPS) { result = result && match(grid, v + offsets[2]); } if (fabs(v[1] - bbox_max[1]) < EPS) { result = result && match(grid, v + offsets[3]); } if (fabs(v[2] - bbox_min[2]) < EPS) { result = result && match(grid, v + offsets[4]); } if (fabs(v[2] - bbox_max[2]) < EPS) { result = result && match(grid, v + offsets[5]); } } return result; }
VectorI MeshCleaner::compute_importance_level(const MatrixFr& vertices) { VectorF bbox_min = vertices.colwise().minCoeff(); VectorF bbox_max = vertices.colwise().maxCoeff(); BoxChecker checker(bbox_min, bbox_max); const size_t num_vertices = vertices.rows(); VectorI level = VectorI::Zero(num_vertices); for (size_t i=0; i<num_vertices; i++) { const VectorF& v = vertices.row(i); if (checker.is_on_boundary_corners(v)) { level[i] = 3; } else if (checker.is_on_boundary_edges(v)) { level[i] = 2; } else if (checker.is_on_boundary(v)) { level[i] = 1; } } return level; }
bool PeriodicExploration::run_tetgen(Float max_tet_vol) { const size_t dim = m_vertices.cols(); const size_t num_vertices = m_vertices.rows(); TetgenWrapper tetgen(m_vertices, m_faces); std::stringstream flags; if (max_tet_vol == 0.0) { max_tet_vol = pow(m_default_thickness * pow(0.5, m_refine_order), dim); } flags << "pqYQa" << max_tet_vol; try { tetgen.run(flags.str()); } catch (TetgenException& e) { save_mesh("tetgen_debug.msh"); std::cerr << "Tetgen failed! Flags: " << flags.str() << std::endl; std::cerr << e.what() << std::endl; std::cerr << "Data saved in tetgen_debug.msh" << std::endl; return false; } // Important note: // // The following code is based on rather shaky the observation that tetgen // will only append to the existing list of vertices. Therefore, the face // arrays are still valid given the "Y" flag is used. MatrixFr vertices = tetgen.get_vertices(); assert(vertices.rows() > 0); assert((vertices.block(0, 0, num_vertices, dim).array()==m_vertices.array()).all()); m_vertices = vertices; m_voxels = tetgen.get_voxels(); const size_t num_vol_vertices = m_vertices.rows(); for (auto& velocity : m_shape_velocities) { velocity.conservativeResize(num_vol_vertices, dim); velocity.block(num_vertices, 0, num_vol_vertices-num_vertices, dim).setZero(); } update_mesh(); return true; }
BoundaryRemesher::BoundaryRemesher(const MatrixFr& vertices, const MatrixIr& faces) : m_vertices(vertices), m_faces(faces) { if (vertices.cols() != 3) { throw NotImplementedError( "Only 3D meshes are supported for remeshing"); } if (faces.cols() != 3) { throw NotImplementedError( "Only triangle meshes are supported for remeshing"); } assert_faces_are_valid(m_faces); }
Boundary::Ptr Boundary::extract_volume_boundary_raw( MatrixFr& vertices, MatrixIr& voxels) { VectorF flattened_vertices = Eigen::Map<VectorF>(vertices.data(), vertices.rows() * vertices.cols()); VectorI faces = VectorI::Zero(0); VectorI flattened_voxels = Eigen::Map<VectorI>(voxels.data(), voxels.rows() * voxels.cols()); size_t vertex_per_voxel = voxels.cols(); size_t vertex_per_face=0; if (vertex_per_voxel == 4) vertex_per_face = 3; else if (vertex_per_voxel == 8) vertex_per_face = 4; else { throw RuntimeError("Unknown voxel type."); } MeshFactory factory; Mesh::Ptr mesh = factory.load_data(flattened_vertices, faces, flattened_voxels, vertices.cols(), vertex_per_face, vertex_per_voxel).create(); return extract_volume_boundary(*mesh); }
void triangulate(MatrixFr vertices, MatrixIr edges, MatrixFr& output_vertices, MatrixIr& output_faces, Float max_area) { assert(edges.rows() >= 3); MeshCleaner cleaner; cleaner.remove_isolated_vertices(vertices, edges); cleaner.remove_duplicated_vertices(vertices, edges, 1e-12); assert(vertices.rows() >= 3); TriangleWrapper triangle(vertices, edges); triangle.run(max_area, false, true, true); output_vertices = triangle.get_vertices(); output_faces = triangle.get_faces(); }
MatrixFr VertexIsotropicOffsetParameter::compute_derivative() const { const VectorF center = m_wire_network->center(); const VectorF bbox_max = m_wire_network->get_bbox_max(); const size_t dim = m_wire_network->get_dim(); const size_t num_vertices = m_wire_network->get_num_vertices(); const size_t roi_size = m_roi.size(); const MatrixFr& vertices = m_wire_network->get_vertices(); assert(roi_size == m_transforms.size()); size_t seed_vertex_index = m_roi.minCoeff(); VectorF seed_vertex = vertices.row(seed_vertex_index); VectorF seed_offset = VectorF::Zero(dim); seed_offset = (bbox_max - center).cwiseProduct(m_dof_dir); MatrixFr derivative = MatrixFr::Zero(num_vertices, dim); for (size_t i=0; i<roi_size; i++) { size_t v_idx = m_roi[i]; assert(v_idx < num_vertices); const MatrixF& trans = m_transforms[i]; derivative.row(v_idx) = trans * seed_offset; } return derivative; }