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

Tielin Dai

dblp:390/8308 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0002-6810-8459ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
biharmonic coordinates
0.912025
Polynomial 2D Biharmonic Coordinates for High-order Cages · ACM Trans. Graph. 2025
Geometric modeling and processing › shape deformation
cage-based deformation
0.912025
Polynomial 2D Biharmonic Coordinates for High-order Cages · ACM Trans. Graph. 2025
Geometric modeling and processing
shape deformation
0.912025
Polynomial 2D Biharmonic Coordinates for High-order Cages · ACM Trans. Graph. 2025
Mathematical optimization › numerical analysis
boundary element method
0.312025
Polynomial 2D Biharmonic Coordinates for High-order Cages · ACM Trans. Graph. 2025

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

closed-form derivation · 1.7boundary element method · 1.7
YearPublicationVenuePosition
2025 Polynomial 2D Biharmonic Coordinates for High-order Cages
abstract
We derive closed-form expressions of biharmonic coordinates for 2D high-order cages, enabling the transformation of the input polynomial curves into polynomial curves of any order. Central to our derivation is the use of the high-order boundary element method. We demonstrate the practicality and effectiveness of our method on various 2D deformations. In practice, users can easily manipulate the Bézier control points to perform the desired intuitive deformation, as the biharmonic coordinates provide an enriched deformation space and encourage the alignment between the boundary cage and its interior geometry.
Shibo Liu 0001, Tielin Dai, Ligang Liu 0001, Xiao-Ming Fu 0001
ACM Trans. Graph.2
2024 Symmetric Piecewise Developable Approximations
abstract
Abstract We propose a novel method for generating symmetric piecewise developable approximations for shapes in approximately global reflectional or rotational symmetry. Given a shape and its symmetry constraint, the algorithm contains two crucial steps: (i) a symmetric deformation to achieve a nearly developable model and (ii) a symmetric segmentation aided by the deformed shape. The key to the deformation step is the use of the symmetric implicit neural representations of the shape and the deformation field. A new mesh extraction from the implicit function is introduced to construct a strictly symmetric mesh for the subsequent segmentation. The symmetry constraint is carefully integrated into the partition to achieve the symmetric piecewise developable approximation. We demonstrate the effectiveness of our algorithm over various meshes.
Ying He 0001, Qing Fang, Zheng Zhang 0062, Tielin Dai, Ligang Liu 0001, Xiao-Ming Fu 0001
Comput. Graph. Forum4