A draw call-oriented approach for visibility of static and dynamic scenes with large number of triangles

Serpa, Yvens R.; Rodriguês, Maria Andréia Formico

doi:10.1007/s00371-018-1484-z

Cited by 9 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With recent CPUs, single instruction, multiple data instructions (SIMD), and GPUs, this fact is even more pronounced. Similar issues arise in other areas of computer graphics, for instance, the cost of rendering a triangle on modern hardware has decreased so significantly that over-culling is currently a significant issue [SR18].…”

Section: Collision Detection Algorithmsmentioning

confidence: 71%

Broadmark: A Testing Framework for Broad‐Phase Collision Detection Algorithms

Serpa

Rodriguês

2019

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

Research in the area of collision detection permeates most of the literature on simulations, interaction and agents planning, being commonly regarded as one of the main bottlenecks for large‐scale systems. To this day, despite its importance, most subareas of collision detection lack a common ground to test and validate solutions, reference implementations and widely accepted benchmark suites. In this paper, we delve into the broad‐phase of collision detection systems, providing both an open‐source framework, named Broadmark, to test, compare and validate algorithms, and an in‐deep analysis of the main techniques used so far to tackle the broad‐phase problem. The technical challenges of building this framework from the software and hardware perspectives are also described. Within our framework, several original and state‐of‐the‐art implementations of CPU and GPU algorithms are bundled, alongside three benchmark scenes to stress algorithms under several conditions. Furthermore, the system is designed to be easily extensible. We use our framework to bring out an extensive performance comparison among assembled solutions, detailing the current CPU and GPU state‐of‐the‐art on a common ground. We believe that Broadmark encompasses the principal insights and tools to derive and evaluate novel algorithms, thus greatly facilitating discussion about successful broad‐phase collision detection solutions.

show abstract

Section: Collision Detection Algorithmsmentioning

confidence: 71%

Broadmark: A Testing Framework for Broad‐Phase Collision Detection Algorithms

Serpa

Rodriguês

2019

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

show abstract

“…They improved their work to apply to dynamic scenes. They focused on the trade-off between the visibility culling ratio and the number of draw calls by using a spatial partitioning structure to reduce the number of draw calls [24].…”

Section: Previous Workmentioning

confidence: 99%

Mesh Clustering and Reordering Based on Normal Locality for Efficient Rendering

Kim

Lee

2022

Symmetry

View full text Add to dashboard Cite

Recently, the size of models for real-time rendering has been significantly increasing for realism, and many graphics applications are being developed in mobile devices with relatively insufficient hardware power. Therefore, improving rendering speed is still important in graphics. Back-face culling is one of the core speed-up techniques to remove the back-facing polygons that are not drawn in the result image. In this paper, we present a mesh clustering and reordering method based on normal coherence for efficient back-face culling at an earlier stage than the current method, which removes back faces after the vertex shader on the GPU. In the pre-computation, our method first vertically clusters the mesh into multiple stripes based on the latitude of the face normal vector and sorts each stripe in ascending order of longitude. At runtime, our method computes a potentially visible set of faces at the current camera view by excluding back faces from the clustered and reordered faces list, and draws only the potentially visible set. Experiments have shown that the rendering using our method is more efficient than traditional methods, especially for large and static models.

show abstract

“…Duas publicações em veículos qualificados, diretamente relacionadas ao mestrado, foram: [Serpa et al 2016] e [Serpa and Rodrigues 2018]. Além destas, outras sete publicações relacionadas, relevantes para o conhecimento técnico e científico e importantes para a capacitação em aplicações gráficas a taxas interativas foram: [Rodrigues et al 2014], [Rodrigues et al 2015a], [Rodrigues et al 2015b], [Macedo et al 2015], [Rodrigues et al 2016], [Rodrigues et al 2017] e [Fonteles et al 2018].…”

Section: Publicações Em Conferências E Periódicosunclassified

“…Este trabalho, síntese da dissertação de mestrado detalhada em [Rebouças Serpa 2017], apresenta RHView, uma solução inovadora e genérica para aplicações gráficas em geral, contendo cenas estáticas e dinâmicas [Serpa and Rodrigues 2018]. RHView foca na remoção de triângulos e no uso eficiente de memória, além de ser (até onde tem conhecimento os autores deste trabalho) aúnica voltada para a redução do número de draw calls.…”

Section: Introductionunclassified

Uma Nova Solução para Visibility Culling de Cenas Genéricas, baseada em Replicação, Heurísticas e Redução de Draw Calls

Serpa¹,

Rodriguês²

2018

Anais Do Concurso De Teses E Dissertações Da SBC (CTD-SBC)

View full text Add to dashboard Cite

Graphics applications with visual quality and increasing levels of interactivity have been of fundamental interest. Within this context, visibility culling algorithms restrict the processing to the objects actually visible by the observer, speeding up the scene visualization. However, state-of-the-art solutions still require a high computational cost, do not scale in complex scenarios and are limited in generalization. In contrast, this work presents RHView, an innovative generic solution for static and dynamics scenes, which is based on a replicated space-partitioning structure and heuristics. RHView uses novel heuristics for rendering time estimation and balance between processing cost and triangle removal accuracy, while maintaining interactive frame rates, even in scenes with billions of triangles. It is the only solution currently available to reduce draw calls, one of the factors that have the greatest impact on graphics processing. Systematic tests have shown that RHView can be up to 2.8 times faster than the state-of-the-art algorithms.

show abstract

A draw call-oriented approach for visibility of static and dynamic scenes with large number of triangles

Cited by 9 publications

References 12 publications

Broadmark: A Testing Framework for Broad‐Phase Collision Detection Algorithms

Broadmark: A Testing Framework for Broad‐Phase Collision Detection Algorithms

Mesh Clustering and Reordering Based on Normal Locality for Efficient Rendering

Uma Nova Solução para Visibility Culling de Cenas Genéricas, baseada em Replicação, Heurísticas e Redução de Draw Calls

Contact Info

Product

Resources

About