Archived issue #0027792
TKMath, BVH - Add tesselator API and implement base marching cube (MC) tessellator
Description
The goal is to extend BVH package with complete set of algorithms allowing generation of distant fields from meshes (or another objects) and tessellation of distant fields. This allows to implement some geometrical algorithm in quite elegant way. E.g., the offset mesh for the given mesh can be calculated in the following way: the input mesh is converted into distant field that represetns the mesh in form of implicit function D(x, y, z) = 0. After that, for generation of offet mesh we need to perform tessellation of implicit function D(x, y, z) - T = 0, where T is desired offset distance.
Steps to reproduce
N/A
Public activity
3 archived notes
Participants are labeled by their role within this record.
Branch [archived branch] has been created by Author.
[revision removed]
Detailed log of new commits:
Author: Author
Date: Thu Aug 18 16:15:26 2016 +0300
0027792: TKMath, BVH -- Add tesselator API and implement base marching cube (MC) tessellator
The goal is to extend BVH package with complete set of algorithms allowing generation of
distant fields from meshes (or another objects) and tessellation of distant fields. This
allows to implement some geometrical algorithm in quite elegant way. E.g., the offset mesh
for the given mesh can be calculated in the following way: the input mesh is converted into
distant field that represents the mesh in form of implicit function D(x, y, z) = 0. After that,
for generation of offset mesh we need to perform tessellation of implicit function D(x, y, z) - T = 0,
where T is desired offset distance.
[revision removed]
Detailed log of new commits:
Author: Author
Date: Thu Aug 18 16:15:26 2016 +0300
0027792: TKMath, BVH -- Add tesselator API and implement base marching cube (MC) tessellator
The goal is to extend BVH package with complete set of algorithms allowing generation of
distant fields from meshes (or another objects) and tessellation of distant fields. This
allows to implement some geometrical algorithm in quite elegant way. E.g., the offset mesh
for the given mesh can be calculated in the following way: the input mesh is converted into
distant field that represents the mesh in form of implicit function D(x, y, z) = 0. After that,
for generation of offset mesh we need to perform tessellation of implicit function D(x, y, z) - T = 0,
where T is desired offset distance.
Dear abv,
Could you please review the patch in branch CR27792?
Could you please review the patch in branch CR27792?
As we discussed, please consider:
- replacing macros (like BVH_DOT3 in BVH_DistanceField.hxx) by inline functions
- providing some tests for the new functionality
- revising the template arguments of the classes that are intended to work only with 3d objects, to exclude dimension argument N, which suggests that the class can work with any dimension. I propose using typed argument instead of plain number, and providing reasonable default for most typical situation of using 3d double vectors.
- replacing macros (like BVH_DOT3 in BVH_DistanceField.hxx) by inline functions
- providing some tests for the new functionality
- revising the template arguments of the classes that are intended to work only with 3d objects, to exclude dimension argument N, which suggests that the class can work with any dimension. I propose using typed argument instead of plain number, and providing reasonable default for most typical situation of using 3d double vectors.