File(s) not publicly available

Polygonisation of non-manifold implicit surfaces using a dual grid and points

conference contribution
posted on 06.12.2017, 00:00 by Dirk Harbinson, Ronald Balsys, K Suffern
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.

Funding

Category 1 - Australian Competitive Grants (this includes ARC, NHMRC)

History

Start Page

26

End Page

31

Number of Pages

6

Start Date

01/01/2010

ISBN-13

9780769541662

Location

Sydney, Australia

Publisher

IEEE Computer Society

Place of Publication

Los Alamitos, California

Peer Reviewed

Yes

Open Access

No

External Author Affiliations

Centre for Intelligent and Networked Systems (CINS); Institute for Resource Industries and Sustainability (IRIS); University of Technology, Sydney;

Era Eligible

Yes

Name of Conference

International Conference on Computer Graphics, Imaging and Visualisation

Exports

CQUniversity

Exports