Curve Complexity Heuristic KD-trees for Neighborhood-based Exploration of 3D Curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Graphics Forum Year : 2021

Curve Complexity Heuristic KD-trees for Neighborhood-based Exploration of 3D Curves

Abstract

We introduce the curve complexity heuristic (CCH), a KD-tree construction strategy for 3D curves, which enables interactive exploration of neighborhoods in dense and large line datasets. It can be applied to searches of k-nearest curves (KNC) as well as radius-nearest curves (RNC). The CCH KD-tree construction consists of two steps: (i) 3D curve decomposition that takes into account curve complexity and (ii) KD-tree construction, which involves a novel splitting and early termination strategy. The obtained KD-tree allows us to improve the speed of existing neighborhood search approaches by at least an order of magnitude (i.e., 28× for KNC and 12× for RNC with 98% accuracy) by considering local curve complexity. We validate this performance with a quantitative evaluation of the quality of search results and computation time. Also, we demonstrate the usefulness of our approach for supporting various applications such as interactive line queries, line opacity optimization, and line abstraction.
Vignette du fichier
cover_image.png (1.08 Mo) Télécharger le fichier Fichier principal
Vignette du fichier
Lu_2021_CCH.pdf (21.41 Mo) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)

Dates and versions

hal-03151998 , version 1 (25-02-2021)

Identifiers

Cite

Yucheng Lu, Luyu Cheng, Tobias Isenberg, Chi-Wing Fu, Guoning Chen, et al.. Curve Complexity Heuristic KD-trees for Neighborhood-based Exploration of 3D Curves. Computer Graphics Forum, 2021, 40 (2), pp.461-474. ⟨10.1111/cgf.142647⟩. ⟨hal-03151998⟩
188 View
176 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More