2 results
Search Results
Now showing 1 - 2 of 2
Item Improving k-buffer Methods via Occupancy Maps(The Eurographics Association, 2015) Vasilakis, Andreas A.; Papaioannou, Georgios; B. Bickel and T. RitschelIn this work, we investigate an efficient approach to treat fragment racing when computing k-nearest fragments. Based on the observation that knowing the depth position of the k-th fragment we can optimally find the k-closest fragments, we introduce a novel fragment culling component by employing occupancy maps.Without any softwareredesign, the proposed scheme can easily be attached at any k-buffer pipeline to efficiently perform early-z culling. Finally, we report on the efficiency, memory space, and robustness of the upgraded k-buffer alternatives providing comprehensive comparison results.Item Fractured Object Reassembly via Robust Surface Registration(The Eurographics Association, 2015) Mavridis, Pavlos; Andreadis, Anthousis; Papaioannou, Georgios; B. Bickel and T. RitschelThe reassembly of fractured 3D objects from their parts is an important problem in cultural heritage and other domains.We approach reassembly from a geometric matching perspective and propose a pipeline for the automatic solution of the problem, where an efficient and generic three-level coarse-to-fine search strategy is used for the underlying global optimization. Key to the efficiency of our approach is the use of a discretized approximation of the surfaces' distance field, which significantly reduces the cost of distance queries and allows our method to systematically search the global parameter space with minimal cost. The resulting reassembly pipeline provides highly reliable alignment, as demonstrated through the reassembly of fractured objects from their fragments and the reconstruction of 3D objects from partial scans, showcasing the wide applicability of our methodology.