Minor changes to 3.1 release documentation:

- fixed dangling links to intro_30.html -- now release_30.html
    - minor changes for consistency and to remove redundancy
This commit is contained in:
barry 2016-10-20 19:53:17 -07:00
parent 7443372690
commit 906f3e0c99
3 changed files with 16 additions and 15 deletions

View File

@ -99,7 +99,7 @@
<li><a href="release_31.html">Release 3.1</a></li> <li><a href="release_31.html">Release 3.1</a></li>
<li><a href="release_30.html">Release 3.0</a></li> <li><a href="release_30.html">Release 3.0</a></li>
<ul> <ul>
<li><a href="intro_30.html">Overview</a></li> <li><a href="release_30.html">Overview</a></li>
<li><a href="porting.html">Porting Guide: 2.0 to 3.0</a></li> <li><a href="porting.html">Porting Guide: 2.0 to 3.0</a></li>
<li><a href="compatibility.html">Subdivision Compatibility</a></li> <li><a href="compatibility.html">Subdivision Compatibility</a></li>
</ul> </ul>

View File

@ -50,7 +50,7 @@ projection (in this case FVAR_LINEAR_NONE):
| :width: 75% | :width: 75% | | :width: 75% | :width: 75% |
| :target: images/fvar_patch_linearall.png | :target: images/fvar_patch_linearnone.png | | :target: images/fvar_patch_linearall.png | :target: images/fvar_patch_linearnone.png |
| | | | | |
| Linear Face-Varying patches | Bicubic Face-Varying patches | | Linear Face-Varying Patches | Bicubic Face-Varying Patches |
+----------------------------------------------+----------------------------------------------+ +----------------------------------------------+----------------------------------------------+
The result on the left shows the old linearly interpolated patches, which The result on the left shows the old linearly interpolated patches, which
@ -113,7 +113,7 @@ In the following example, a single semi-sharp vertex is refined to level 5:
+--------------------------------------+--------------------------------------+ +--------------------------------------+--------------------------------------+
| .. image:: images/sec_level_off.png | .. image:: images/sec_level_on.png | | .. image:: images/sec_level_off.png | .. image:: images/sec_level_on.png |
| :align: center | :align: center | | :align: center | :align: center |
| :width: 100% | :width: 100% | | :width: 75% | :width: 75% |
| :target: images/sec_level_off.png | :target: images/sec_level_on.png | | :target: images/sec_level_off.png | :target: images/sec_level_on.png |
| | | | | |
| Single Isolation Level 5 | Primary Level 5, Secondary Level 2 | | Single Isolation Level 5 | Primary Level 5, Secondary Level 2 |
@ -123,7 +123,7 @@ Single isolation to level 5 on the left results in 312 patches. The right shows
semi-sharp feature isolated to 5, but with the new "secondary level" set to 2, the semi-sharp feature isolated to 5, but with the new "secondary level" set to 2, the
number of patches is reduced to 123. number of patches is reduced to 123.
The second specified level of adaptive refinement -- the "secondary level" -- is used The second specified level of adaptive refinement is used
to halt isolation for features that typically do not require the specified maximum. to halt isolation for features that typically do not require the specified maximum.
These include interior and boundary extra-ordinary vertices and those infinitely sharp These include interior and boundary extra-ordinary vertices and those infinitely sharp
patches that correspond to boundary extra-ordinary patches. patches that correspond to boundary extra-ordinary patches.
@ -138,9 +138,9 @@ The motivation for sharp patches is to accurately represent the limit surface of
infinitely sharp features, which otherwise can only be approximated by very high levels infinitely sharp features, which otherwise can only be approximated by very high levels
of adaptive refinement, resulting in many unnecessary patches. of adaptive refinement, resulting in many unnecessary patches.
The true limit surface for regular faces along an infinitely sharp crease is actually a The true limit surface for regular faces along an infinitely sharp crease is a
regular B-Spline patch -- essentially the same as regular faces along a boundary. And regular B-Spline patch -- the same as regular faces along a boundary.
similarly, the limit surface for faces around an extra-ordinary vertex on an infinitely Similarly, the limit surface for faces around an extra-ordinary vertex on an infinitely
sharp crease is the same as that of faces around an extra-ordinary vertex on a boundary. sharp crease is the same as that of faces around an extra-ordinary vertex on a boundary.
So these patches are identified and isolated to the same degree -- the regular patches So these patches are identified and isolated to the same degree -- the regular patches
as soon as possible, and the irregular patches to the depth specified. as soon as possible, and the irregular patches to the depth specified.
@ -164,8 +164,7 @@ level 2 further reduces the number of patches to 42.
The use of infinitely sharp patches can be enabled both at a high level as an new option to Osd::Mesh, The use of infinitely sharp patches can be enabled both at a high level as an new option to Osd::Mesh,
or more directly when adaptively refining or construction the patch tables in or more directly when adaptively refining or construction the patch tables in
Far::TopologyRefiner::AdaptiveOptions and Far::PatchTableFactory::Options. See the API additions Far::TopologyRefiner::AdaptiveOptions and Far::PatchTableFactory::Options.
below and their associated Doxygen text for more details.
Given the improved accuracy and reduced patches by the use of simple regular patches, we would prefer Given the improved accuracy and reduced patches by the use of simple regular patches, we would prefer
that this be the default behavior, but it was made an explicit option in order to avoid disrupting that this be the default behavior, but it was made an explicit option in order to avoid disrupting
@ -299,6 +298,6 @@ Bug Fixes
~~~~~~~~~ ~~~~~~~~~
- Fixed Ptex version parsing and compatibility issues - Fixed Ptex version parsing and compatibility issues
- Fixed compatibility issues with VS2015 - Fixed compatibility issues with VS2015
- Fixed some bugs with HUD sliders in the example viewers - Fixed bug interpolating face-varying data with Bilinear scheme
- Fixed bug with Bilinear interpolation of face-varying data
- Fixed bug with refinement using Chaikin creasing - Fixed bug with refinement using Chaikin creasing
- Fixed bugs with HUD sliders in the example viewers

View File

@ -34,7 +34,9 @@
Release 3.1.0 Release 3.1.0
============= =============
Release 3.1.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. Release 3.1.0 is a significant release with several new features, bug fixes, and general
code and configuration improvements. For more information on the following, please see
`Release 3.1 <release_31.html>`__
**New Features** **New Features**
- Bicubic Face-Varying Patches - Bicubic Face-Varying Patches
@ -60,9 +62,9 @@ Release 3.1.0 is a significant release with several new features, bug fixes, and
**Bug Fixes** **Bug Fixes**
- Fixed Ptex version parsing and compatibility issues - Fixed Ptex version parsing and compatibility issues
- Fixed compatibility issues with VS2015 - Fixed compatibility issues with VS2015
- Fixed some bugs with HUD sliders in the example viewers - Fixed bug interpolating face-varying data with Bilinear scheme
- Fixed bug with Bilinear interpolation of face-varying data
- Fixed bug with refinement using Chaikin creasing - Fixed bug with refinement using Chaikin creasing
- Fixed bugs with HUD sliders in the example viewers
Release 3.0.5 Release 3.0.5
============= =============
@ -154,7 +156,7 @@ Release 3.0.0
Release 3.0.0 is a major release with many significant improvements and Release 3.0.0 is a major release with many significant improvements and
changes. For more information on the following, please see changes. For more information on the following, please see
`Introduction to 3.0 <intro_30.html>`__ `Release 3.0 <release_30.html>`__
**New Features** **New Features**
- Faster subdivision using less memory - Faster subdivision using less memory