Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

  • e31fa09
  • /
  • src
  • /
  • external
  • /
  • ArcSim
  • /
  • io.cpp
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
content badge
swh:1:cnt:a49a990c96ceb950b59ce4adb2908ef1cb7eeb62
directory badge
swh:1:dir:70754d5bbbcb118b85e3fd43533ce31be60ab86b

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
io.cpp
/*
Copyright ©2013 The Regents of the University of California
(Regents). All Rights Reserved. Permission to use, copy, modify, and
distribute this software and its documentation for educational,
research, and not-for-profit purposes, without fee and without a
signed licensing agreement, is hereby granted, provided that the
above copyright notice, this paragraph and the following two
paragraphs appear in all copies, modifications, and
distributions. Contact The Office of Technology Licensing, UC
Berkeley, 2150 Shattuck Avenue, Suite 510, Berkeley, CA 94720-1620,
(510) 643-7201, for commercial licensing opportunities.

IN NO EVENT SHALL REGENTS BE LIABLE TO ANY PARTY FOR DIRECT,
INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING
LOST PROFITS, ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS
DOCUMENTATION, EVEN IF REGENTS HAS BEEN ADVISED OF THE POSSIBILITY
OF SUCH DAMAGE.

REGENTS SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE. THE SOFTWARE AND ACCOMPANYING
DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS
IS". REGENTS HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT,
UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*/

#include "io.hpp"

#include "util.hpp"
#include <cassert>
#include <cfloat>
#include <fstream>
#include <sstream>
using namespace std;


const int FILE_VERSION = 1;


// OBJ meshes

void get_valid_line(istream &in, string &line) {
	do
		getline(in, line);
	while (in && (line.length() == 0 || line[0] == '#'));
}

void triangle_to_obj(const string &inname, const string &outname) {
	fstream outfile(outname.c_str(), ios::out);
	{ // nodes
		string filename = inname + ".node";
		fstream file(filename.c_str(), ios::in);
		string line;
		get_valid_line(file, line);
		stringstream linestream(line);
		int nv, dim, na, nb;
		linestream >> nv >> dim >> na >> nb;
		for (int i = 0; i < nv; i++) {
			get_valid_line(file, line);
			stringstream linestream(line);
			int index;
			linestream >> index;
			Vec2 u;
			linestream >> u[0] >> u[1];
			outfile << "v " << u[0] << " " << u[1] << " " << 0 << endl;
		}
	}
	{ // eles
		string filename = inname + ".ele";
		fstream file(filename.c_str(), ios::in);
		string line;
		get_valid_line(file, line);
		stringstream linestream(line);
		int nt, nn, na;
		linestream >> nt >> nn >> na;
		for (int i = 0; i < nt; i++) {
			get_valid_line(file, line);
			stringstream linestream(line);
			int index;
			linestream >> index;
			int v0, v1, v2;
			linestream >> v0 >> v1 >> v2;
			outfile << "f " << v0 + 1 << " " << v1 + 1 << " " << v2 + 1 << endl;
		}
	}
}

vector<Face*> triangulateARC(const vector<Vert*> &verts);

void load_obj(Mesh &mesh, const string &filename) {
	delete_mesh(mesh);
	fstream file(filename.c_str(), ios::in);
	if (!file) {
		cout << "Error: failed to open file " << filename << endl;
		return;
	}
	while (file) {
		string line;
		get_valid_line(file, line);
		stringstream linestream(line);
		string keyword;
		linestream >> keyword;
		if (keyword == "vt") {
			Vec2 u;
			linestream >> u[0] >> u[1];
			mesh.add(new Vert(expand_xy(u), Vec3(0)));
		}
		else if (keyword == "ms") {
			Vec3 u;
			linestream >> u[0] >> u[1] >> u[2];
			mesh.add(new Vert(u, Vec3(0)));
		}
		else if (keyword == "v") {
			Vec3 x;
			linestream >> x[0] >> x[1] >> x[2];
			mesh.add(new Node(x, x, Vec3(0), 0, 0, false));
		}
		else if (keyword == "ny") {
			Vec3 &y = mesh.nodes.back()->y;
			linestream >> y[0] >> y[1] >> y[2];
		}
		else if (keyword == "nv") {
			Vec3 &v = mesh.nodes.back()->v;
			linestream >> v[0] >> v[1] >> v[2];
		}
		else if (keyword == "nl") {
			linestream >> mesh.nodes.back()->label;
		}
		else if (keyword == "e") {
			int n0, n1;
			linestream >> n0 >> n1;
			mesh.add(new Edge(mesh.nodes[n0 - 1], mesh.nodes[n1 - 1], 0, 0));
		}
		else if (keyword == "ea") {
			linestream >> mesh.edges.back()->theta_ideal;
		}
		else if (keyword == "ed") {
			linestream >> mesh.edges.back()->damage;
		}
		else if (keyword == "ep") {
			linestream >> mesh.edges.back()->preserve;
		}
		else if (keyword == "f") {
			vector<Vert*> verts;
			vector<Node*> nodes;
			string w;
			while (linestream >> w) {
				stringstream wstream(w);
				int v, n;
				char c;
				wstream >> n >> c >> v;
				nodes.push_back(mesh.nodes[n - 1]);
				if (wstream) {
					verts.push_back(mesh.verts[v - 1]);
				}
				else if (!nodes.back()->verts.empty()) {
					verts.push_back(nodes.back()->verts[0]);
				}
				else {
					verts.push_back(new Vert(nodes.back()->x0, Vec3(0)));
					mesh.add(verts.back());
				}
			}
			for (int v = 0; v < (int)verts.size(); v++)
				connect(verts[v], nodes[v]);
			vector<Face*> faces = triangulateARC(verts);
			for (int f = 0; f < (int)faces.size(); f++)
				mesh.add(faces[f]);
		}
		else if (keyword == "tm") {
			linestream >> mesh.faces.back()->flag;
		}
		else if (keyword == "tp") {
			Mat3x3 &S = mesh.faces.back()->Sp_bend;
			for (int i = 0; i<3; i++) for (int j = 0; j<3; j++)
				linestream >> S(i, j);
		}
		else if (keyword == "ts") {
			Mat3x3 &S = mesh.faces.back()->Sp_str;
			for (int i = 0; i<3; i++) for (int j = 0; j<3; j++)
				linestream >> S(i, j);
		}
		else if (keyword == "td") {
			linestream >> mesh.faces.back()->damage;
		}
	}
	mark_nodes_to_preserve(mesh);
	compute_ms_data(mesh);
}

// Added by Nick for cloth obj loading
void load_cloth_obj(Mesh &mesh, const string &filename) {
	delete_mesh(mesh);
	fstream file(filename.c_str(), ios::in);
	if (!file) {
		cout << "Error: failed to open file " << filename << endl;
		return;
	}
	while (file) {
		string line;
		get_valid_line(file, line);
		stringstream linestream(line);
		string keyword;
		linestream >> keyword;
		if (keyword == "v") {
			Vec3 x;
			linestream >> x[0] >> x[1] >> x[2];
			x[0] += 0.5;
			x[1] += 0.5;
			if (x[0] <= 0.015) x[0] = 0.0;
			if (x[0] >= 0.985) x[0] = 1.0;
			if (x[1] <= 0.015) x[1] = 0.0;
			if (x[1] >= 0.985) x[1] = 1.0;
			Vec3 ver = Vec3(x[0], x[1], 0.0);
			mesh.add(new Node(x, x, Vec3(0), 0, 0, false));
			mesh.add(new Vert(ver, Vec3(0)));
		}
		else if (keyword == "f") {
			vector<Vert*> verts;
			vector<Node*> nodes;
			string w;
			while (linestream >> w) {
				stringstream wstream(w);
				int n;
				wstream >> n;
				nodes.push_back(mesh.nodes[n - 1]);
				verts.push_back(mesh.verts[n - 1]);
			}
			for (int v = 0; v < (int)verts.size(); v++)
				connect(verts[v], nodes[v]);
			vector<Face*> faces = triangulateARC(verts);
			for (int f = 0; f < (int)faces.size(); f++)
				mesh.add(faces[f]);
		}
	}
}

static double angle(const Vec3 &x0, const Vec3 &x1, const Vec3 &x2) {
	Vec3 e1 = normalize(x1 - x0);
	Vec3 e2 = normalize(x2 - x0);
	return acos(clamp(dot(e1, e2), -1., 1.));
}

vector<Face*> triangulateARC(const vector<Vert*> &verts) {
	int n = verts.size();
	double best_min_angle = 0;
	int best_root = -1;
	for (int i = 0; i < n; i++) {
		double min_angle = infinity;
		const Vert *vert0 = verts[i];
		for (int j = 2; j < n; j++) {
			const Vert *vert1 = verts[(i + j - 1) % n], *vert2 = verts[(i + j) % n];
			min_angle = min(min_angle,
				angle(vert0->node->x, vert1->node->x, vert2->node->x),
				angle(vert1->node->x, vert2->node->x, vert0->node->x),
				angle(vert2->node->x, vert0->node->x, vert1->node->x));
		}
		if (min_angle > best_min_angle) {
			best_min_angle = min_angle;
			best_root = i;
		}
	}
	int i = best_root;
	Vert* vert0 = verts[i];
	vector<Face*> tris;
	for (int j = 2; j < n; j++) {
		Vert *vert1 = verts[(i + j - 1) % n], *vert2 = verts[(i + j) % n];
		tris.push_back(new Face(vert0, vert1, vert2, Mat3x3(1), Mat3x3(0), 0, 0));
	}
	return tris;
}

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API