Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lei Li 0052

dblp:13/7007-52 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-0612-312XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape analysis › skeleton extraction
curve skeleton extraction
1.222023
Robustly Extracting Concise 3D Curve Skeletons by Enhancing the Capture of Prominent Features · IEEE Trans. Vis. Comput. Graph. 2023
A Simple and Stable Centeredness Measure for 3D Curve Skeleton Extraction · IEEE Trans. Vis. Comput. Graph. 2022
Geometric modeling and processing › shape representation › medial representation
medial surface
0.612022
A Simple and Stable Centeredness Measure for 3D Curve Skeleton Extraction · IEEE Trans. Vis. Comput. Graph. 2022
Geometric modeling and processing
shape analysis
0.612022
A Simple and Stable Centeredness Measure for 3D Curve Skeleton Extraction · IEEE Trans. Vis. Comput. Graph. 2022

Methods — techniques the papers use, named apart from their topics

mesh simplification · 0.7medial mesh contraction · 0.7parallel computation · 0.6minimum set cover · 0.6inside-out evolution · 0.6
YearPublicationVenuePosition
2023 Robustly Extracting Concise 3D Curve Skeletons by Enhancing the Capture of Prominent Features
abstract
Extracting concise 3D curve skeletons with existing methods is still a serious challenge as these methods require tedious parameter adjustment to suppress the influence of shape boundary perturbations to avoid spurious branches. In this paper, we address this challenge by enhancing the capture of prominent features and using them for skeleton extraction, motivated by the observation that the shape is mainly represented by prominent features. Our method takes the medial mesh of the shape as input, which can maintain the shape topology well. We develop a series of novel measures for simplifying and contracting the medial mesh to capture prominent features and represent them concisely, by which means the influences of shape boundary perturbations on skeleton extraction are suppressed and the quantity of data needed for skeleton extraction is significantly reduced. As a result, we can robustly and concisely extract the curve skeleton based on prominent features, avoiding the trouble of tuning parameters and saving computations, as shown by experimental results.
Yiyao Chu, Wencheng Wang 0001, Lei Li 0052
IEEE Trans. Vis. Comput. Graph.3
2022 A Simple and Stable Centeredness Measure for 3D Curve Skeleton Extraction
abstract
Existing methods for extracting 3D curve skeletons mostly suffer from the difficulty of finding the center points of 3D shapes and tedious manual adjustments of the thresholds for pruning spurious branches due to the influence of shape boundary perturbations. In this article, we present a method based on medial surfaces of 3D shapes for the convenient and fast extraction of high-quality curve skeletons. Our main contribution is a simple and stable centeredness measure. It is based on simulating fire propagation via the scheme of inside-out evolution from the interior to the boundary, differentiating it from existing methods that use the scheme of outside-in evolution from the boundary to the interior. Thus, our measure is much more localized, and it can be implemented with a high degree of parallelism. In addition, we propose measures to effectively suppress the influence of details to obtain a stable measurement, and employ minimum set covers to optimize the center points to generate compact skeletons, which enables spurious branches to be effectively excluded without the tedious work of manually adjusting thresholds. Our experiments show the superiority of our method over existing methods, including its convenient generation of clean, compact and centered curve skeletons while running much faster than state-of-the-art methods.
Lei Li 0052, Wencheng Wang 0001, Yiyao Chu
IEEE Trans. Vis. Comput. Graph.1