RELEASE_HISTORY.txt 5.2 KB

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