RELEASE_HISTORY.txt 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. # Version tracking
  2. Version | Short description
  3. --------|----------------------------------------------------------------------
  4. 1.1.7 | Switch build for static library to cmake.
  5. 1.1.6 | Major boolean robustness fix, drop CGAL dependency for AABB/distances
  6. 1.1.5 | Bug fix in booleans
  7. 1.1.4 | Edge collapsing and linear program solving
  8. 1.1.3 | Bug fixes in active set and boundary_conditions
  9. 1.1.1 | PLY file format support
  10. 1.1.0 | Mesh boolean operations using CGAL and cork, implementing [Attene 14]
  11. 1.0.3 | Bone heat method
  12. 1.0.2 | Bug fix in winding number code
  13. 1.0.1 | Bug fixes and more CGAL support
  14. 1.0.0 | Major beta release: many renames, tutorial, triangle, org. build
  15. ## Version 1.0 Changes ##
  16. Our beta release marks our confidence that this library can be used outside of
  17. casual experimenting. To maintain order, we have made a few changes which
  18. current users should read and adapt their code accordingly.
  19. ### Renamed functions ###
  20. The following table lists functions which have changed name as of version
  21. 1.0.0:
  22. Old | New
  23. -------------------------------- | -------------------------------------
  24. `igl::add_barycenter` | `igl::false_barycentric_subdivision`
  25. `igl::areamatrix` | `igl::vector_area_matrix`
  26. `igl::barycentric2global` | `igl::barycentric_to_global`
  27. `igl::boundary_faces` | `igl::boundary_facets`
  28. `igl::boundary_vertices_sorted` | `igl::boundary_loop`
  29. `igl::cotangent` | `igl::cotmatrix_entries`
  30. `igl::edgetopology` | `igl::edge_topology`
  31. `igl::gradMat` | `igl::grad`
  32. `igl::is_manifold` | `igl::is_edge_manifold`
  33. `igl::mexStream` | `igl::MexStream`
  34. `igl::moveFV` | `igl::average_onto_vertices`
  35. `igl::moveVF` | `igl::average_onto_faces`
  36. `igl::plot_vector` | `igl::print_vector`
  37. `igl::pos` | `igl::HalfEdgeIterator`
  38. `igl::plane_project` | `igl::project_isometrically_to_plane`
  39. `igl::project_points_mesh` | `igl::line_mesh_intersection`
  40. `igl::read` | `igl::read_triangle_mesh`
  41. `igl::removeDuplicates.cpp` | `igl::remove_duplicates`
  42. `igl::removeUnreferenced` | `igl::remove_unreferenced`
  43. `igl::tt` | `igl::triangle_triangle_adjacency`
  44. `igl::vf` | `igl::vertex_triangle_adjacency`
  45. `igl::write` | `igl::write_triangle_mesh`
  46. `igl::manifold_patches` | `igl::orientable_patches`
  47. `igl::selfintersect` | `igl::remesh_self_intersections`
  48. `igl::project_mesh` | `igl::line_mesh_intersection`
  49. `igl::triangulate` | `igl::polygon_mesh_to_triangle_mesh`
  50. `igl::is_manifold` | `igl::is_edge_manifold`
  51. `igl::triangle_wrapper` | `igl::triangulate`
  52. ### Miscellaneous ###
  53. - To match interfaces provided by (all) other quadratic optimization
  54. libraries, `igl::min_quad_with_fixed` and `igl::active_set` now expect as
  55. input twice the quadratic coefficients matrix, i.e. the Hessian. For
  56. example, `igl::min_quad_with_fixed(H,B,...)` minimizes $\frac{1}{2}x^T H
  57. x+x^T B$.
  58. - We have inverted the `IGL_HEADER_ONLY` macro to `IGL_STATIC_LIBRARY`. To
  59. compile using libigl as a header-only library, simply include headers and
  60. libigl in the header search path. To link to libigl, you must define the
  61. `IGL_STATIC_LIBRARY` macro at compile time and link to the `libigl*.a`
  62. libraries.
  63. - Building libigl as a static library is now more organized. There is a
  64. `build/` directory with Makefiles for the main library (`Makefile`) and each
  65. dependency (e.g. `Makefile_mosek` for `libiglmosek.a`)
  66. - `igl::polar_svd` now always returns a rotation in `R`, never a reflection.
  67. This mirrors the behavior of `igl::polar_svd3x3`. Consequently the `T`
  68. part may have negative skews.
  69. - We have organized the static
  70. - The previous `igl::grad` function, which computed the per-triangle gradient
  71. of a per-vertex scalar function has been replaced. Now `igl::grad` computes
  72. the linear operator (previous computed using `igl::gradMat`). The gradient
  73. values can still be recovered by multiplying the operator against the scalar
  74. field as a vector and reshaping to have gradients per row.
  75. - `MASSMATRIX_*` has become `MASSMATRIX_TYPE_*`
  76. - The function `igl::project_normals`, which cast a line for each vertex of
  77. mesh _A_ in the normal direction and found the closest intersection along
  78. these lines with mesh _B_, has been removed.
  79. 0.4.6 Generalized Winding Numbers
  80. 0.4.5 CGAL extra: mesh selfintersection
  81. 0.4.4 STL file format support
  82. 0.4.3 ARAP implementation
  83. 0.4.1 Migrated much of the FAST code including extra for Sifakis' 3x3 svd
  84. 0.4.0 Release under MPL2 license
  85. 0.3.7 Embree2.0 support
  86. 0.3.6 boost extra, patches, mosek 7 support, libiglbbw (mosek optional)
  87. 0.3.5 More examples, naive primitive sorting
  88. 0.3.3 Many more examples, ambient occlusion with Embree.
  89. 0.3.1 Linearly dependent constraints in min_quad_with_fixed, SparseQR buggy
  90. 0.3.0 Better active set method support
  91. 0.2.3 More explicits, active set method, opengl/anttweakbar guards
  92. 0.2.2 More explicit instanciations, faster sorts and uniques
  93. 0.2.1 Bug fixes in barycenter and doublearea found by Martin Bisson
  94. 0.2.0 XML serializer more stable and fixed bug in remove_duplicate_vertices
  95. 0.1.8 Embree and xml (windows only) extras
  96. 0.1.5 Compilation on windows, bug fix for compilation with cygwin
  97. 0.1.1 Alpha release with core functions, extras, examples