PMR: point to mesh rendering, a feature-based approach

Dey,; Hudson, Peter J.

doi:10.1109/visual.2002.1183770

Cited by 22 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Temporal coherence can be exploited by keeping track of the visible Surfels in the frame buffer of successive frames [Guennebaud et al 2004]. Another useful application of point primitives is the rendering of regions of a triangle mesh with small screen-space projection area [Chen and Nguyen 2001;Dey and Hudson 2002]. In our approach, we independently render each local geometry by quasi-random point generation.…”

Section: Representationmentioning

confidence: 99%

Statistical geometry representation for efficient transmission and rendering

Kalaiah

Varshney

2005

ACM Trans. Graph.

View full text Add to dashboard Cite

Traditional geometry representations have focused on representing the details of the geometry in a deterministic fashion. In this article we propose a statistical representation of the geometry that leverages local coherence for very large datasets. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck, both on the system bus and over the network as well as for randomized rendering, without sacrificing visual realism. Our statistical representation is built using a clustering-based hierarchical principal component analysis (PCA) of the point geometry. It gives us a hierarchical partitioning of the geometry into compact local nodes representing attributes such as spatial coordinates, normal, and color. We pack this information into a few bytes using classification and quantization. This allows our representation to directly render from compressed format for efficient remote as well as local rendering. Our representation supports both viewdependent and on-demand rendering. Our approach renders each node using quasi-random sampling utilizing the probability distribution derived from the PCA analysis. We show many benefits of our approach: (1) several-fold improvement in the storage and transmission complexity of point geometry; (2) direct rendering from compressed data; and (3) support for local and remote rendering on a variety of rendering platforms such as CPUs, GPUs, and PDAs.

show abstract

Section: Representationmentioning

confidence: 99%

Statistical geometry representation for efficient transmission and rendering

Kalaiah

Varshney

2005

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…The early member of this family is the QSplat technique developed by Rusinkiewicz et al [Rusinkiewicz and Levoy 2000] as part of the Digital Michelangelo Project ]. That kind of technique has also been used in hybrid point-polygon rendering systems [Dachsbacher et al 2003;Chen and Nguyen 2001;Cohen et al 2001;Dey and Hudson 2002;Coconu and Hege 2002;Gobbetti and Marton 2005]. These techniques do not propose a solution to the so-called hole filling problem.…”

Section: Previous Workmentioning

confidence: 99%

Surfel Stripping

Boubekeur

Reuter

Schlick

2005

Proceedings of the 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and South East A

View full text Add to dashboard Cite

Figure 1: The Asian Dragon can be rendered at its full definition of 3 609 601 points, with antialiased 2D texturing and cube mapping, at 31 frames per second at a display resolution of 1600x1200 pixels. AbstractThis paper presents an efficient combination of techniques for fast stripping and multiresolution rendering of Point-Based Surfaces (PBS) called Surfel Stripping. Surfel Strips are small triangle strips that interpolate the PBS. There are two major contributions. First, at loading time, we efficiently convert the PBS into triangle strips. This is done by first generating a set of overlapping small triangular meshes that interpolate the PBS, then removing redundant triangles and finally stripping the small triangular meshes by using a cachefriendly stripping method. All these operations are performed by using an octree data structure. Second, we reuse this data structure for providing a multiresolution interactive visualization of the surfel strips at rendering time. Since Surfel Stripping is local and very fast, it can be used in a lot of situations as an object-space alternative to the image-space surface splatting and thus be considered half way between point-based rendering and local polygonal generation. Rendering Surfel Strips is very efficient since it neither requires multi-pass rendering nor time-consuming vertex/fragment shaders compared to surface splatting. We show also how to exploit the locality of the surfel strips for maintaining compatibility with point-based modeling tools, such as local deformations of surfaces. We finally give some examples of well known visual enrichments developed for polygons, directly applied to PBS thanks to surfel strips.

show abstract

“…A feature is defined as a meaningful area or, more specifically, a boundary region between distinct parts that can be visibly separated by the human eye. Because it represents crucial characteristics of underlying geometry, to know feature points in advance improves the performance in geometry processing such as adaptive sampling and segmentation [5][6][7][8]. Most existing studies on feature detection have focused on 2-manifold polygonal meshes.…”

Section: Introductionmentioning

confidence: 99%