Real-Time Terrain Modeling Using CPU-GPU Coupled Computation

Bernhardt,; Maximo, André; Velho,; Hnaidi,; Cani,

doi:10.1109/sibgrapi.2011.28

Cited by 25 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However user strokes are interpreted as path layouts and not as terrain silhouettes. Multi-grid diffusion methods enable generation of terrains that simultaneously match several feature curves, either drawn from a top view [14] or from an arbitrary viewpoint [27]. The main limitation is that generated terrains typically lack realistic details.…”

Section: Related Workmentioning

confidence: 99%

“…The average manual editing time was less than a minute. Comparing feature-based constraints against planar curve constraints: Typical sketch-based terrain deformation techniques [13,27,15] use planar curve constraints computed from user strokes. Such planar curves can be obtained by computing the drawing plane from the user sketch and projecting strokes on this plane to obtained their 3D position in world coordinates.…”

Section: Validation Examplesmentioning

confidence: 99%

See 1 more Smart Citation

Feature-based terrain editing from complex sketches

Tasse

Emilien

Cani

et al. 2014

Computers & Graphics

Self Cite

View full text Add to dashboard Cite

International audienceWe present a new method for first person sketch-based editing of terrain models. As in usual artistic pictures, the input sketchdepicts complex silhouettes with cusps and T-junctions, which typically correspond to non-planar curves in 3D. After analysingdepth constraints in the sketch based on perceptual cues, our method best matches the sketched silhouettes with silhouettes or ridgesof the input terrain. A deformation algorithm is then applied to the terrain, enabling it to exactly match the sketch from the givenperspective view, while insuring that none of the user-defined silhouettes is hidden by another part of the terrain. We extend thissketch-based terrain editing framework to handle a collection of multi-view sketches. As our results show, this method enablesusers to easily personalize an existing terrain, while preserving its plausibility and style

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Validation Examplesmentioning

confidence: 99%

Feature-based terrain editing from complex sketches

Tasse

Emilien

Cani

et al. 2014

Computers & Graphics

Self Cite

View full text Add to dashboard Cite

show abstract

“…Furthermore, these problems can become even larger, to the point that not even a multi-core CPU-based algorithm is fast enough. Problems such as these can be found in science and technology; natural sciences [52,108,116] (Physics, Biology, Chemistry), information technologies [115] (IT), geospatial information systems [11,66] (GIS), structural mechanics problems [12] and even abstract mathematical/computer science (CS) problems [84,98,101,109]. Today, many of these problems can be solved faster and more efficiently by using massive parallel processors.…”

Section: Introductionmentioning

confidence: 99%

A Survey on Parallel Computing and its Applications in Data-Parallel Problems Using GPU Architectures

Navarro

Hitschfeld

Mateu

2014

Commun. comput. phys.

162

View full text Add to dashboard Cite

Abstract. Parallel computing has become an important subject in the field of computer science and has proven to be critical when researching high performance solutions. The evolution of computer architectures (multi-core and many-core) towards a higher number of cores can only confirm that parallelism is the method of choice for speeding up an algorithm. In the last decade, the graphics processing unit, or GPU, has gained an important place in the field of high performance computing (HPC) because of its low cost and massive parallel processing power. Super-computing has become, for the first time, available to anyone at the price of a desktop computer. In this paper, we survey the concept of parallel computing and especially GPU computing. Achieving efficient parallel algorithms for the GPU is not a trivial task, there are several technical restrictions that must be satisfied in order to achieve the expected performance. Some of these limitations are consequences of the underlying architecture of the GPU and the theoretical models behind it. Our goal is to present a set of theoretical and technical concepts that are often required to understand the GPU and its massive parallelism model. In particular, we show how this new technology can help the field of computational physics, especially when the problem is data-parallel. We present four examples of computational physics problems; n-body, collision detection, Potts model and cellular automata simulations. These examples well represent the kind of problems that are suitable for GPU computing. By understanding the GPU architecture and its massive parallelism programming model, one can overcome many of the technical limitations found along the way, design better GPU-based algorithms for computational physics problems and achieve speedups that can reach up to two orders of magnitude when compared to sequential implementations.

show abstract

“…By making use of quad tree structure, Bernhardt et al [7] proposed a perfect solution to constitute real-time and multi-resolution terrains dynamically, and to resolve the discontinuity of grids. Li et al [8] proposed an algorithm of modeling and solving of multi-resolution mesh of visual sphere, which can generate a sphere mesh under an arbitrary viewpoint and view direction and can expand multi-resolution structure to spherical surface.…”

Section: Introductionmentioning

confidence: 99%

Construction and Scheduling of Multi-resolution LOD Terrain in Super Low-Altitude Flight

Zou¹,

Bian²,

Chen³

et al. 2015

IJCEE

View full text Add to dashboard Cite

Abstract:In visual navigation system, a method of construction and scheduling of multi-resolution LOD terrain is designed according to the influence of terrain precision on super low flight. First, the tiled pyramid is constituted to manage the terrain data, which is organized by quadtree. The terrain complexity-based node selection criterion is used to select the required blocks for rendering. Then, the structural similarity of quadtree nodes is made use of to symmetrically cluster two-level nodes, which is suitable for batch scheduling of terrain data. Experimental results show that this method improves the terrain precise from a certain range of the aircraft, reduces the frequency of data scheduling, and enhances the rendering frame rates of navigation scene.

show abstract

Real-Time Terrain Modeling Using CPU-GPU Coupled Computation

Cited by 25 publications

References 19 publications

Feature-based terrain editing from complex sketches

Feature-based terrain editing from complex sketches

A Survey on Parallel Computing and its Applications in Data-Parallel Problems Using GPU Architectures

Construction and Scheduling of Multi-resolution LOD Terrain in Super Low-Altitude Flight

Contact Info

Product

Resources

About