Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
Daniel Kopta, Thiago Ize, Josef B. Spjut, Erik Bru...
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
—We propose a novel approach for the reconstruction of urban structures from 3D point clouds with an assumption of Manhattan World (MW) building geometry; i.e., the predominance ...
Carlos A. Vanegas, Daniel G. Aliaga, Bedrich Benes
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...