Hybrid Polygon-Point Rendering of Singular and Non-Manifold Implicit Surfaces

Harbinson, D; Balsys, R; Suffern, K

Hybrid Polygon-Point Rendering of Singular and Non-Manifold Implicit Surfaces

Harbinson, D Balsys, R Suffern, K

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2019 23rd International Conference in Information Visualization – Part II, 2019
Issue Date:: 2019-07

Closed Access

	Filename	Description	Size
	08812008.pdf	Published version	179.18 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Harbinson, D
dc.contributor.author	Balsys, R
dc.contributor.author	Suffern, K
dc.date	2019-07-16
dc.date.accessioned	2020-06-18T21:59:26Z
dc.date.available	2020-06-18T21:59:26Z
dc.date.issued	2019-07
dc.identifier.citation	2019 23rd International Conference in Information Visualization – Part II, 2019
dc.identifier.isbn	978-1-7281-2850-4
dc.identifier.uri	http://hdl.handle.net/10453/141542
dc.description.abstract	A hybrid polygons-points algorithm based on a hierarchical decomposition of the bounding volume using an octree spatial data structure, and testing cell occupation with interval arithmetic is given. Polygons are produced where curvature in occupied cells is low and points are used where curvature is high. As a result, points are rendered around extreme features and polygons around regular features. Using this approach implicit surfaces of high complexity, such as recursively defined curvature surfaces, are rendered. A discussion of the implementation is given for a GPU version of the algorithm and a comparison with GPU ray-casting is made. As the approach uses subdivision and it can be used for surface modelling. An advantage of the approach is the few artefacts that occur with singular points, cusps, rays and curves of self intersection. Production of antialiased animations and multiple views of the surface can be faster than in ray-casting. The algorithm is robust, renders singular and non-manifold surface and the algorithm works for algebraic and non-algebraic surfaces.
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	2019 23rd International Conference in Information Visualization – Part II
dc.relation.ispartof	International Conference in Information Visualization – Part II
dc.relation.isbasedon	10.1109/iv-2.2019.00039
dc.rights	© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Hybrid Polygon-Point Rendering of Singular and Non-Manifold Implicit Surfaces
dc.type	Conference Proceeding
utslib.location.activity	Adelaide, Australia
utslib.for	0803 Computer Software
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2020-06-18T21:59:22Z
pubs.finish-date	2019-07-19
pubs.place-of-publication	Piscataway, USA
pubs.publication-status	Published
pubs.start-date	2019-07-16
dc.location	Piscataway, USA

Abstract:

A hybrid polygons-points algorithm based on a hierarchical decomposition of the bounding volume using an octree spatial data structure, and testing cell occupation with interval arithmetic is given. Polygons are produced where curvature in occupied cells is low and points are used where curvature is high. As a result, points are rendered around extreme features and polygons around regular features. Using this approach implicit surfaces of high complexity, such as recursively defined curvature surfaces, are rendered. A discussion of the implementation is given for a GPU version of the algorithm and a comparison with GPU ray-casting is made. As the approach uses subdivision and it can be used for surface modelling. An advantage of the approach is the few artefacts that occur with singular points, cusps, rays and curves of self intersection. Production of antialiased animations and multiple views of the surface can be faster than in ray-casting. The algorithm is robust, renders singular and non-manifold surface and the algorithm works for algebraic and non-algebraic surfaces.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/141542