ubpa / games102 Goto Github PK

void QuadricSimplification::contract(const PairContraction& pc) {
	heMesh->AddVertex();
	auto* v1 = heMesh->Vertices().at(pc.i);
	auto* v2 = heMesh->Vertices().at(pc.j);
	auto* v_bar = heMesh->Vertices().at(pc.k);
	v_bar->position = positions[pc.k];
	/*std::set<Vertex*> s;
	for (auto* v : v1->AdjVertices()) s.insert(v);
	for (auto* v : v2->AdjVertices()) s.insert(v);*/
	
	auto V1s = v1->AdjVertices();
	auto V2s = v2->AdjVertices();

	for (size_t i = 0; i < V1s.size(); i++) {
		spdlog::info("{}", heMesh->Index(V1s[i]));
	}
	spdlog::info("-------");
	for (size_t i = 0; i < V2s.size(); i++) {
		spdlog::info("{}", heMesh->Index(V2s[i]));
	}

	// merge neighbors, maybe repeat 2 times
	std::vector<Vertex*> Vs;
	for (auto* v : v1->AdjVertices()) {
		if (v == v2) {
			auto v2_vec = v2->AdjVertices();
			for (size_t i = 0; i < v2_vec.size();i ++) {
				if (v2_vec[i] == v1) {
					for (size_t j = 1; j < v2_vec.size(); j++) {
						int id = (i + j) % v2_vec.size();
						Vs.push_back(v2_vec[id]);
					}
					break;
				}
			}
		}
		else {
			Vs.push_back(v);
		}
	}

	// record boundary info before removing
	bool is_boundary = v1->IsOnBoundary() || v2->IsOnBoundary();
	std::vector<bool> mark;
	for (size_t i = 0; i < Vs.size(); i++) {
		spdlog::info("after merge {}", heMesh->Index(Vs[i]));
		mark.push_back(Vs[i]->IsOnBoundary());
	}

	for (auto* m : v1->AdjPolygons()) {
		if (m == nullptr) continue;
		auto* A = m->AdjVertices()[0];
		auto* B = m->AdjVertices()[1];
		auto* C = m->AdjVertices()[2];
		spdlog::info("v1 adj {} {} {}", heMesh->Index(A), heMesh->Index(B), heMesh->Index(C));
		heMesh->RemovePolygon(m);
	}

	for (auto* m : v2->AdjPolygons()) {
		if (m == nullptr) continue;
		auto* A = m->AdjVertices()[0];
		auto* B = m->AdjVertices()[1];
		auto* C = m->AdjVertices()[2];
		spdlog::info("v2 adj {} {} {}", heMesh->Index(A), heMesh->Index(B), heMesh->Index(C));
		heMesh->RemovePolygon(m);
	}

	// add triangle
	for (size_t i = 0; i < Vs.size(); i++) {
		int id = (0 + i) % Vs.size();
		int nx = (0 + i + 1) % Vs.size();
		Vertex* A = Vs[id];
		Vertex* B = Vs[nx];
		if (A == B) continue;
		if (is_boundary && mark[id] && mark[nx]) continue;
		spdlog::info("add triangle {} {} {}", heMesh->Index(B), heMesh->Index(A), heMesh->Index(v_bar));
		std::vector<Vertex*> polygon = { B, A, v_bar };
		std::vector<HalfEdge*> heLoop;
		for (size_t j = 0; j < polygon.size(); j++) {
			size_t next = (j + 1) % polygon.size();
			auto* u = polygon[j];
			auto* v = polygon[next];
			auto* he = u->HalfEdgeTo(v);
			if (!he)
				he = heMesh->AddEdge(u, v)->HalfEdge();
			heLoop.push_back(he);
		}
		auto* p = heMesh->AddPolygon(heLoop);
		assert(p != nullptr);
	}
	
	spdlog::info("contract ({}, {}) -> {}", pc.i, pc.j, pc.k);
}