loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)
Adaptive Polygonisation of Non-Manifold Implicit Surfaces
Beijing, China
July 26-July 29
ISBN: 0-7695-2392-7
ASCII Text
x 
 
R. J. Balsys, K. G. Suffern, "Adaptive Polygonisation of Non-Manifold Implicit Surfaces," Computer Graphics, Imaging and Visualization, International Conference on, pp. 257-263, International Conference on Computer Graphics, Imaging and Visualization (CGIV'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CGIV.2005.13,
author = {R. J. Balsys and K. G. Suffern},
title = {Adaptive Polygonisation of Non-Manifold Implicit Surfaces},
journal ={Computer Graphics, Imaging and Visualization, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2392-7},
pages = {257-263},
doi = {http://doi.ieeecomputersociety.org/10.1109/CGIV.2005.13},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Graphics, Imaging and Visualization, International Conference on
TI - Adaptive Polygonisation of Non-Manifold Implicit Surfaces
SN - 0-7695-2392-7
SP257
EP263
A1 - R. J. Balsys,
A1 - K. G. Suffern,
PY - 2005
KW - implicit surfaces
KW - non-manifold
KW - octrees
KW - intervals
KW - polygonisation
KW - line-stitching
VL - 0
JA - Computer Graphics, Imaging and Visualization, International Conference on
ER -
 
R. J. Balsys, Central Queensland University
K. G. Suffern, University Technology - Sydney
We discuss the polygonisation and rendering of non-manifold implicit surfaces using adaptive octree subdivision and interval arithmetic for surface exclusion in octree nodes. We present a new algorithm that polygonises some surfaces that self intersect, or have other non-manifold features such as separate sections that meet at points. Gradient information is used to resolve ambiguous polygonisations in plotting nodes. A line-stitching algorithm is discussed that allows for multiple polygons to be in a plotting node. We illustrate the algorithm with a number of surfaces that demonstrate its capabilities and limitations.
Index Terms:
implicit surfaces, non-manifold, octrees, intervals, polygonisation, line-stitching
Citation:
R. J. Balsys, K. G. Suffern, "Adaptive Polygonisation of Non-Manifold Implicit Surfaces," cgiv, pp.257-263, International Conference on Computer Graphics, Imaging and Visualization (CGIV'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.