DocumentCode
2142007
Title
Polygonisation of Non-manifold Implicit Surfaces Using a Dual Grid and Points
Author
Harbinson, D.J. ; Balsys, R.J. ; Suffern, K.G.
Author_Institution
CINS, CQU, Rockhampton, QLD, Australia
fYear
2010
fDate
7-10 Aug. 2010
Firstpage
26
Lastpage
31
Abstract
Our polygons/points method is octree based, uses interval and point sampling of the surface curvature to drive the subdivision, and uses a pruning algorithm to generate points that are rendered where the surface curvature is high, or around non-manifold features. This approach allows us to visualise both manifold and non-manifold implicit surfaces of high complexity. We discuss necessary modifications of the dual grid method to polygonise the surfaces. The main advantage of the dual grid is that cracks do not form between shared plotting node faces that are at different depths. Polygons are formed as a mixture of triangles and quadrilaterals. We also discuss improvements to the grid so that slither triangles do not form.We render a variety of non-manifold implicit surfaces to demonstrate the results from our algorithm. We also discuss the advantages of this approach.
Keywords
computational complexity; computational geometry; dual grid method; nonmanifold implicit surfaces polygonisation; point sampling; polygons-points method; pruning algorithm; surface curvature; Manifolds; Octrees; Real time systems; Rendering (computer graphics); Surface cracks; Surface treatment; Visualization; dual grid; implicit surface; in- tervals; node pruning; non-manifold; octree; points; polygons;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Graphics, Imaging and Visualization (CGIV), 2010 Seventh International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4244-7840-8
Type
conf
DOI
10.1109/CGIV.2010.35
Filename
5575904
Link To Document