Abstract | ||
---|---|---|
We discuss the polygonisation and rendering ofnon-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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1109/CGIV.2005.13 | CGIV |
Keywords | Field | DocType |
adaptive polygonisation,self intersect,ambiguous polygonisations,octree node,interval arithmetic,new algorithm,ofnon-manifold implicit surface,line-stitching algorithm,gradient information,non-manifold implicit surfaces,multiple polygon,adaptive octree subdivision,rendering,intervals,polynomials,computer graphics,information technology,computational geometry,informatics,sampling methods,arithmetic,robustness | Computer vision,Polygon,Computer science,Computational geometry,Subdivision,Artificial intelligence,Rendering (computer graphics),Interval arithmetic,Computer graphics,Manifold,Octree | Conference |
ISBN | Citations | PageRank |
0-7695-2392-7 | 5 | 0.43 |
References | Authors | |
5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
R. J. Balsys | 1 | 33 | 2.88 |
K. G. Suffern | 2 | 12 | 2.14 |