Difference between revisions of "Triangulation"

From apm
Jump to: navigation, search
m (added category)
m (added)
 
(8 intermediate revisions by the same user not shown)
Line 7: Line 7:
  
 
* [[Constructive solid geometry]] – a perhaps useful novel algorithm is proposed there {{wikitodo|eventually move it over to here}}
 
* [[Constructive solid geometry]] – a perhaps useful novel algorithm is proposed there {{wikitodo|eventually move it over to here}}
 +
* [[Quadriculation]]
 +
* [[Decompression chain]] & [[Control hierarchy]]
 +
* [[Bulk limit design]]
  
 
== External links ==
 
== External links ==
  
 +
* [https://en.wikipedia.org/wiki/Surface_triangulation Surface triangulation] / [https://en.wikipedia.org/wiki/Triangulation_(geometry) Triangulation (geometry)]
 +
* ([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)]
 +
-----
 
* [https://en.wikipedia.org/wiki/Marching_cubes Marching cubes] – quite popular triangulation method – but leads to quite ugly meshes
 
* [https://en.wikipedia.org/wiki/Marching_cubes Marching cubes] – quite popular triangulation method – but leads to quite ugly meshes
* [https://en.wikipedia.org/wiki/Surface_triangulation Surface triangulation]
 
  
 
[[Category:Pages with algorithms]]
 
[[Category:Pages with algorithms]]
 +
[[Category:Programming]]

Latest revision as of 13:03, 11 July 2023

This article is a stub. It needs to be expanded.

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

External links


  • Marching cubes – quite popular triangulation method – but leads to quite ugly meshes