Integration of gauss map, osculating toroidal patches, loop detection and C2 judgement to figure out the singular or loop intersection.
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
#pragma once
|
|
|
|
|
#include <chrono>
|
|
|
|
|
#include <string>
|
|
|
|
|
#include <iostream>
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
namespace utils {
|
|
|
|
|
class Timer {
|
|
|
|
|
public:
|
|
|
|
|
explicit Timer(const string& name);
|
|
|
|
|
chrono::time_point<chrono::steady_clock> record;
|
|
|
|
|
string eventName;
|
|
|
|
|
void restart();
|
|
|
|
|
void end() const;
|
|
|
|
|
};
|
|
|
|
|
}
|
