Modeling and rendering of points with local geometry
- 6 February 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 9 (1) , 30-42
- https://doi.org/10.1109/tvcg.2003.1175095
Abstract
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 (DP), 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.Keywords
This publication has 37 references indexed in Scilit:
- Temporal continuity of levels of detail in Delaunay triangulated terrainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust creation of implicit surfaces from polygonal meshesIEEE Transactions on Visualization and Computer Graphics, 2002
- Out-of-core simplification of large polygonal modelsPublished by Association for Computing Machinery (ACM) ,2000
- The ball-pivoting algorithm for surface reconstructionIEEE Transactions on Visualization and Computer Graphics, 1999
- LDI treePublished by Association for Computing Machinery (ACM) ,1999
- Multiresolution signal processing for meshesPublished by Association for Computing Machinery (ACM) ,1999
- A comparison of mesh simplification algorithmsComputers & Graphics, 1998
- Fitting smooth surfaces to dense polygon meshesPublished by Association for Computing Machinery (ACM) ,1996
- Automatic reconstruction of surfaces and scalar fields from 3D scansPublished by Association for Computing Machinery (ACM) ,1995
- Using particles to sample and control implicit surfacesPublished by Association for Computing Machinery (ACM) ,1994