• Corpus ID: 9500947

Identifying Planes in Point Clouds for Efficient Hybrid Rendering

@inproceedings{Wahl2005IdentifyingPI,
  title={Identifying Planes in Point Clouds for Efficient Hybrid Rendering},
  author={Roland Wahl and Michael Guthe and R. Klein},
  year={2005}
}
We present a hybrid rendering technique for highfeature colored point clouds that achieves both, high performance and high quality. Planar subsets in the point cloud are identified to drastically reduce the number of vertices, thus saving transformation bandwidth at the cost of the much higher fill-rate. Moreover, when rendering the planes, the filtering is comparable to elaborate point-rendering methods but significantly faster since it is supported in hardware. This way we achieve at least a… 

Figures and Tables from this paper

High Quality Point-Based Rendering System

TLDR
A point cloud simplification algorithm which simplifies input point model by using clustering techniques, a combination of ideas from different algorithms which includes advantages of different algorithms to give high quality rendering.

A Overview of Point-based Rendering Techniques

TLDR
This work has the basis of understanding of the various popular algorithms for point rendering like qsplat and elliptical weighted average splatting and will discuss advantages and disadvantages of each of the approaches and the result of all various algorithms.

Point Based Rendering M. Tech Project 1st Stage Report

TLDR
The pros and cons of several algorithms proposed for rendering point models efficiently and with high quality are discussed and in particular algorithms that can be applied based on requirement are discussed.

Compression and rendering of textured point clouds via sparse coding

TLDR
The goal is to achieve compression ratios that outperform generic texture compression algorithms, while still retaining the ability to efficiently render without prior decompression, in a compression and rendering method designed for large textured point cloud datasets.

Out-of-core real-time visualization of massive 3D point clouds

TLDR
A point-based rendering approach to visualize massive sets of 3D points in real-time to overcome the limit of memory and increase the performance taking into account user interaction as well as available hardware resources is presented.

Hardware Accelerated Rendering of Unprocessed Point Clouds

TLDR
The method includes view-frustum culling and a level-of-detail (LOD) algorithm which does not need any additional geometry to the original point cloud, and renders always faster than the simple usage of vertex buffer objects (VBOs).

Hybrid Visualization of Sparse Point-Based Data Using GPGPU

TLDR
This paper introduces a novel hybrid visualization method that utilizes point- based and volume-based rendering of sparse point-based data and achieves real-time visualization, while retaining high visual accuracy, as shown on cosmological dark matter SPH-based dataset.

Displacement Mapped Billboard Clouds

TLDR
DMBBC is introduced, a new image-based rendering primitive for the fast display of geometrically complex objects at medium to far distances and several ways to store the volumetric information, with different tradeoffs between memory requirements and image quality.

Scalable Realtime Rendering and Interaction with Digital Surface Models of Landscapes and Cities

TLDR
This thesis presents LOD schemes for the efficient rendering of 2.5d digital surface models and 3d point-clouds, a method for the automatic derivation of city models from raw DSMs, and an approach allowing semantic interaction with complex LOD models, and a method to combine semantic information with complex geometric models.

References

SHOWING 1-10 OF 37 REFERENCES

High-quality point-based rendering on modern GPUs

  • M. BotschL. Kobbelt
  • Computer Science
    11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings.
  • 2003
TLDR
A rendering framework for point-based geometry providing high visual quality as well as efficient rendering based on a two-pass splatting technique with Gaussian filtering, resulting in a visual quality comparable to existing software rendering systems.

Real-time appearance preserving out-of-core rendering with shadows

TLDR
A novel LOD selection and prefetching method for real-time rendering of hard shadows that entirely runs on a single CPU system is presented.

Optimized Sub‐Sampling of Point Sets for Surface Splatting

TLDR
A new sub‐sampling technique for dense point clouds is presented which is specifically adjusted to the particular geometric properties of circular or elliptical surface splats, and is able to obtain significantly lower splat numbers for a given error tolerance.

Rendering Forest Scenes in Real-Time

TLDR
A new representation allowing for the real-time rendering of realistic forests covering an arbitrary terrain is proposed, which lets us produce dense forests corresponding to continuous non-repetitive fields made of thousands of trees with full parallax.

Textured Depth Meshes for Realtime Rendering of Arbitrary Scenes

TLDR
A new approach to generate textured depth meshes (TDMs), an impostor-based scene representation that can be used to accelerate the rendering of static polygonal models, thereby cutting down on impstor complexity and storage costs.

Surface splatting

TLDR
A point rendering and texture filtering technique called surface splatting which directly renders opaque and transparent surfaces from point clouds without connectivity based on a novel screen space formulation of the Elliptical Weighted Average (EWA) filter is described.

Memory Efficient Billboard Clouds for BTF Textured Objects

TLDR
BTF textured billboard clouds are introduced which drastically increase the visual quality by preserving view- and light-dependent effects like reflection properties, changing silhouette and changing shadows while preserving the fast rendering performance.

Billboard clouds for extreme model simplification

TLDR
This work introduces billboard clouds -- a new approach for extreme simplification in the context of real-time rendering that combines the strengths of mesh decimation and image-based impostors.

Point Sample Rendering

TLDR
A novel solution to the problem of surface reconstruction using a hierarchy of Z-buffers to detect tears is introduced, suitable for real-time, high quality rendering of complex objects.

POP: a hybrid point and polygon rendering system for large data

TLDR
This work uses both points and polygons to represent and render large mesh models and starts from triangles as leaf nodes and builds up a hierarchical tree structure with intermediate nodes as points.