资 源 简 介
This is an implementation of exact geodesic algorithm for triangular mesh (first described by Mitchell, Mount and Papadimitriou in 1987) with some minor improvements, extensions and simplifications. The algorithm has O(n^2 log n) worst-case time complexity, but in practice can work with million-node meshes in reasonable time. For the quick overview, see J. O"Rourke, "Computational Geometry Column 35", SIGACT News, 30(2) Issue #111.
文 件 列 表
geodesic_algorithm_subdivision.h
geodesic_constants_and_simple_functions.h
geodesic_matlab_api.h
geodesic_memory.h
geodesic_mesh.h
geodesic_mesh_elements.h
example0.cpp
example1.cpp
geodesic_matlab_api.cpp
flat_triangular_mesh.txt
hedgehog_mesh.txt
readme.txt
geodesic_algorithm_base.h
geodesic_algorithm_dijkstra.h
geodesic_algorithm_dijkstra_alternative.h
geodesic_algorithm_exact.h
geodesic_algorithm_exact_elements.h
geodesic_algorithm_graph_base.h
