|
1 | | -#include <iostream> |
2 | | -#include <fstream> |
3 | | - |
4 | | -#include "geodesic_library/geodesic_algorithm_exact.h" |
5 | | - |
6 | | -extern "C" { |
7 | | - double computeGdist(int numberOfVertices, int numberOfTriangles, double *vertices, double *triangles); |
8 | | -}; |
9 | | - |
10 | | -double computeGdist(int numberOfVertices, int numberOfTriangles, double *vertices, double *triangles) { |
11 | | - return 1.0; |
12 | | -} |
| 1 | +#include <iostream> |
| 2 | +#include <fstream> |
| 3 | +#include <inttypes.h> |
| 4 | + |
| 5 | +#include "geodesic_library/geodesic_algorithm_exact.h" |
| 6 | + |
| 7 | + |
| 8 | +#if defined(_WIN32) |
| 9 | +# if defined(DLL_EXPORTS) |
| 10 | +# define DLL_EXPORT_API __declspec(dllexport) |
| 11 | +# else |
| 12 | +# define DLL_EXPORT_API __declspec(dllimport) |
| 13 | +# endif |
| 14 | +#else |
| 15 | +# define DLL_EXPORT_API |
| 16 | +#endif |
| 17 | + |
| 18 | + |
| 19 | +void compute_gdist_impl( |
| 20 | + unsigned number_of_vertices, |
| 21 | + unsigned number_of_triangles, |
| 22 | + double *vertices, |
| 23 | + int *triangles, |
| 24 | + unsigned number_of_source_indices, |
| 25 | + unsigned number_of_target_indices, |
| 26 | + unsigned *source_indices_array, |
| 27 | + unsigned *target_indices_array, |
| 28 | + double *distance, |
| 29 | + double distance_limit |
| 30 | +) { |
| 31 | + |
| 32 | + std::vector<double> points (vertices, vertices + number_of_vertices); |
| 33 | + std::vector<unsigned> faces (triangles, triangles + number_of_triangles); |
| 34 | + std::vector<unsigned> source_indices (source_indices_array, source_indices_array + number_of_source_indices); |
| 35 | + std::vector<unsigned> target_indices (target_indices_array, target_indices_array + number_of_target_indices); |
| 36 | + |
| 37 | + geodesic::Mesh mesh; |
| 38 | + mesh.initialize_mesh_data(points, faces); // create internal mesh data structure including edges |
| 39 | + |
| 40 | + geodesic::GeodesicAlgorithmExact algorithm(&mesh); // create exact algorithm for the mesh |
| 41 | + |
| 42 | + std::vector<geodesic::SurfacePoint> all_sources, stop_points; |
| 43 | + |
| 44 | + for (unsigned i = 0; i < number_of_source_indices; ++i) { |
| 45 | + all_sources.push_back(geodesic::SurfacePoint(&mesh.vertices()[source_indices[i]])); |
| 46 | + } |
| 47 | + |
| 48 | + for (unsigned i = 0; i < number_of_target_indices; ++i) { |
| 49 | + stop_points.push_back(geodesic::SurfacePoint(&mesh.vertices()[target_indices[i]])); |
| 50 | + } |
| 51 | + |
| 52 | + algorithm.propagate(all_sources, distance_limit, &stop_points); |
| 53 | + |
| 54 | + for (unsigned i = 0; i < stop_points.size(); ++i) { |
| 55 | + algorithm.best_source(stop_points[i], distance[i]); |
| 56 | + } |
| 57 | +} |
| 58 | + |
| 59 | +double* local_gdist_matrix_impl( |
| 60 | + unsigned number_of_vertices, |
| 61 | + unsigned number_of_triangles, |
| 62 | + double *vertices, |
| 63 | + unsigned *triangles, |
| 64 | + unsigned *sparse_matrix_size, |
| 65 | + double max_distance |
| 66 | +) { |
| 67 | + std::vector<double> points (vertices, vertices + number_of_vertices); |
| 68 | + std::vector<unsigned> faces (triangles, triangles + number_of_triangles); |
| 69 | + |
| 70 | + geodesic::Mesh mesh; |
| 71 | + mesh.initialize_mesh_data(points, faces); // create internal mesh data structure including edges |
| 72 | + geodesic::GeodesicAlgorithmExact algorithm(&mesh); // create exact algorithm for the mesh |
| 73 | + std::vector <unsigned> rows_vector, columns_vector; |
| 74 | + std::vector <double> data_vector; |
| 75 | + |
| 76 | + double distance = 0; |
| 77 | + |
| 78 | + std::vector<geodesic::SurfacePoint> targets(number_of_vertices), source; |
| 79 | + |
| 80 | + for (unsigned i = 0; i < number_of_vertices; ++i) { |
| 81 | + targets[i] = geodesic::SurfacePoint(&mesh.vertices()[i]); |
| 82 | + } |
| 83 | + for (unsigned i = 0; i < number_of_vertices / 3; ++i) { |
| 84 | + source.push_back(geodesic::SurfacePoint(&mesh.vertices()[i])); |
| 85 | + algorithm.propagate(source, max_distance, NULL); |
| 86 | + source.pop_back(); |
| 87 | + for (unsigned j = 0; j < number_of_vertices / 3; ++j) { |
| 88 | + algorithm.best_source(targets[j], distance); |
| 89 | + if (distance != geodesic::GEODESIC_INF && distance != 0 && distance <= max_distance) { |
| 90 | + rows_vector.push_back(i); |
| 91 | + columns_vector.push_back(j); |
| 92 | + data_vector.push_back(distance); |
| 93 | + } |
| 94 | + } |
| 95 | + } |
| 96 | + |
| 97 | + double *data; |
| 98 | + data = new double[3 * rows_vector.size()]; |
| 99 | + |
| 100 | + *sparse_matrix_size = rows_vector.size(); |
| 101 | + |
| 102 | + std::copy(rows_vector.begin(), rows_vector.end(), data); |
| 103 | + std::copy(columns_vector.begin(), columns_vector.end(), data + data_vector.size()); |
| 104 | + std::copy(data_vector.begin(), data_vector.end(), data + 2 * data_vector.size()); |
| 105 | + |
| 106 | + return data; |
| 107 | +} |
| 108 | + |
| 109 | + |
| 110 | +extern "C" { |
| 111 | + DLL_EXPORT_API void compute_gdist( |
| 112 | + unsigned number_of_vertices, |
| 113 | + unsigned number_of_triangles, |
| 114 | + double *vertices, |
| 115 | + int *triangles, |
| 116 | + unsigned number_of_source_indices, |
| 117 | + unsigned number_of_target_indices, |
| 118 | + unsigned *source_indices_array, |
| 119 | + unsigned *target_indices_array, |
| 120 | + double *distance, |
| 121 | + double distance_limit |
| 122 | + ) { |
| 123 | + compute_gdist_impl( |
| 124 | + number_of_vertices, |
| 125 | + number_of_triangles, |
| 126 | + vertices, |
| 127 | + triangles, |
| 128 | + number_of_source_indices, |
| 129 | + number_of_target_indices, |
| 130 | + source_indices_array, |
| 131 | + target_indices_array, |
| 132 | + distance, |
| 133 | + distance_limit |
| 134 | + ); |
| 135 | + } |
| 136 | + |
| 137 | + DLL_EXPORT_API double* local_gdist_matrix( |
| 138 | + unsigned number_of_vertices, |
| 139 | + unsigned number_of_triangles, |
| 140 | + double *vertices, |
| 141 | + unsigned *triangles, |
| 142 | + unsigned *sparse_matrix_size, |
| 143 | + double max_distance |
| 144 | + ) { |
| 145 | + return local_gdist_matrix_impl( |
| 146 | + number_of_vertices, |
| 147 | + number_of_triangles, |
| 148 | + vertices, |
| 149 | + triangles, |
| 150 | + sparse_matrix_size, |
| 151 | + max_distance |
| 152 | + ); |
| 153 | + } |
| 154 | +}; |
0 commit comments