Modeling and rendering of points with local geometry

被引:42
作者
Kalaiah, A [1 ]
Varshney, A
机构
[1] Univ Maryland, Graph & Visual Informat Lab, Dept Comp Sci, College Pk, MD 20742 USA
[2] Univ Maryland, UMIACS, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
differential geometry; simplification; point sample rendering; per-pixel shading;
D O I
10.1109/TVCG.2003.1175095
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a novel rendering primitive that combines the modeling brevity of points with the rasterization efficiency of polygons. The surface is represented by a sampled collection of Differential Points (DIP), each with embedded curvature information that captures the local differential geometry in the vicinity of that point. This is a more general point representation that, for the cost of a few additional bytes, packs much more information per point than the traditional point-based models. This information is used to efficiently render the surface as a collection of local geometries. To use the hardware acceleration, the DPs are quantized into 256 different types and each sampled point is approximated by the closest quantized DP and is rendered as a normal-mapped rectangle. The advantages to this representation are: 1) The surface can be represented more sparsely compared to other point primitives, 2) it achieves a robust hardware accelerated per-pixel shading-even with no connectivity information, and 3) it offers a novel point-based simplification technique that factors in the complexity of the local geometry. The number of primitives being equal, DPs produce a much better quality of rendering than a pure splat-based approach. Visual appearances being similar, DPs are about two times faster and require about 75 percent less disk space in comparison to splatting primitives.
引用
收藏
页码:30 / 42
页数:13
相关论文
共 41 条
[1]  
ALEXA M, 2001, P IEEE VIS 2001 OCT
[2]  
[Anonymous], P EUR REND WORKSH 97
[3]  
[Anonymous], GRAPH GEMS
[4]  
BAJAJ CL, 1995, P SIGGRAPH, P109
[5]  
BERALDIN JA, 1999, P 2 INT C 3D DIG IM, P34
[6]   The ball-pivoting algorithm for surface reconstruction [J].
Bernardini, F ;
Mittleman, J ;
Rushmeier, H ;
Silva, C ;
Taubin, G .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1999, 5 (04) :349-359
[7]  
Chang CF, 1999, COMP GRAPH, P291, DOI 10.1145/311535.311571
[8]  
CHEN B, 2001, P IEEE VIS 01 OCT
[9]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[10]  
COHEN J, 2000, SIGGRAPH 2000 JUL