Difference between revisions of "Triangulation"
From apm
(added link to yet unwritten page Bulk limit design) |
m |
||
Line 17: | Line 17: | ||
* [https://en.wikipedia.org/wiki/Triangulation_(geometry) Triangulation (geometry)] | * [https://en.wikipedia.org/wiki/Triangulation_(geometry) Triangulation (geometry)] | ||
* ([https://en.wikipedia.org/wiki/Triangle_mesh Triangle mesh]) | * ([https://en.wikipedia.org/wiki/Triangle_mesh Triangle mesh]) | ||
+ | * Not to confuse with triangulation in other contexts: [https://en.wikipedia.org/wiki/Triangulation_(disambiguation) Triangulation (disambiguation)] | ||
[[Category:Pages with algorithms]] | [[Category:Pages with algorithms]] |
Revision as of 23:26, 21 November 2021
Finding a triangle mesh that is approximating a somehow specified volume.
E.g. specified by some "function representation" like e.g. "signed distance functions".
Related
- Constructive solid geometry – a perhaps useful novel algorithm is proposed there (wiki-TODO: eventually move it over to here)
- Quadriculation
- Decompression chain & Control hierarchy
- Bulk limit design
External links
- Marching cubes – quite popular triangulation method – but leads to quite ugly meshes
- Surface triangulation
- Triangulation (geometry)
- (Triangle mesh)
- Not to confuse with triangulation in other contexts: Triangulation (disambiguation)