Efficient Structure-Aware Selection Techniques for 3D Point Cloud Visualizations with 2DOF Input

被引:47
作者
Yu, Lingyun [1 ]
Efstathiou, Konstantinos [1 ]
Isenberg, Petra [3 ]
Isenberg, Tobias [1 ,2 ]
机构
[1] Univ Groningen, NL-9700 AB Groningen, Netherlands
[2] CNRS, INRIA, DIGITEO, F-75700 Paris, France
[3] INRIA, Orsay, France
关键词
3D interaction; spatial selection; direct-touch interaction; VIRTUAL ENVIRONMENTS; EXPLORATION;
D O I
10.1109/TVCG.2012.217
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Data selection is a fundamental task in visualization because it serves as a pre-requisite to many follow-up interactions. Efficient spatial selection in 3D point cloud datasets consisting of thousands or millions of particles can be particularly challenging. We present two new techniques, TeddySelection and CloudLasso, that support the selection of subsets in large particle 3D datasets in an interactive and visually intuitive manner. Specifically, we describe how to spatially select a subset of a 3D particle cloud by simply encircling the target particles on screen using either the mouse or direct-touch input. Based on the drawn lasso, our techniques automatically determine a bounding selection surface around the encircled particles based on their density. This kind of selection technique can be applied to particle datasets in several application domains. TeddySelection and CloudLasso reduce, and in some cases even eliminate, the need for complex multi-step selection processes involving Boolean operations. This was confirmed in a formal, controlled user study in which we compared the more flexible CloudLasso technique to the standard cylinder-based selection technique. This study showed that the former is consistently more efficient than the latter-in several cases the CloudLasso selection time was half that of the corresponding cylinder-based selection.
引用
收藏
页码:2245 / 2254
页数:10
相关论文
共 39 条
[1]  
[Anonymous], 1987, ACM siggraph computer graphics, DOI [10.1145/37401.37422, DOI 10.1145/37401.37422]
[2]  
[Anonymous], 2008, Introduction to information retrieval
[3]   Efficient 3D Pointing Selection in Cluttered Virtual Environments [J].
Argelaguet, Ferran ;
Andujar, Carlos .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 2009, 29 (06) :34-43
[4]  
Buxton W., 1986, PROC IFIP WORLD COMP, P475
[5]  
DAAELAMPE O, 2011, P IEEE PAC VIS, P171, DOI DOI 10.1109/PACIFICVIS.2011.5742387
[6]  
de Haan Gerwin., 2005, Proceedings of the 11th Eurographics conference on Virtual Environments EGVE'05, P201, DOI DOI 10.2312/EGVE/IPT_EGVE2005/201-209
[7]   The hierarchical formation of the brightest cluster galaxies [J].
De Lucia, Gabriella ;
Blaizot, Jeremy .
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2007, 375 (01) :2-14
[8]  
Dehmeshki H, 2008, LECT NOTES COMPUT SC, V5166, P33, DOI 10.1007/978-3-540-85412-8_4
[9]  
Dehmeshki H, 2009, LECT NOTES COMPUT SC, V5531, P243
[10]  
Elmqvist N, 2008, IEEE T VIS COMPUT GR, V14, P1141, DOI 10.1109/TVCG.2008.153