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

Weihua Tong

dblp:19/7301 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-4314-0842ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 9 · 2 first-author · 3 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
3 papers
Geometric modeling and processing · 88% Computational fabrication · 12%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh segmentation
0.412020
Spectral Mesh Segmentation via ℓ0 Gradient Minimization · IEEE Trans. Vis. Comput. Graph. 2020
Geometric modeling and processing
mesh processing
0.212016
Compact implicit surface reconstruction via low-rank tensor approximation · Comput. Aided Des. 2016
Geometric modeling and processing
surface reconstruction
0.212016
Compact implicit surface reconstruction via low-rank tensor approximation · Comput. Aided Des. 2016
Computational fabrication
additive manufacturing
0.212013
Cost-effective printing of 3D objects with skin-frame structures · ACM Trans. Graph. 2013
Geometric modeling and processing
implicit surface
0.112016
Compact implicit surface reconstruction via low-rank tensor approximation · Comput. Aided Des. 2016

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

fiedler vector · 0.9coarse-to-fine strategy · 0.9alternating direction method of multipliers · 0.9low-rank tensor approximation · 0.2preemptive algorithm · 0.2multiobjective programming · 0.2l0 sparsity optimization · 0.2
YearPublicationVenuePosition
2026 High-quality approximation of Catmull-Clark subdivision surfaces via G 1 -continuous biquartic patches
Macheng Tao, Weihua Tong, Zhangjin Huang
Comput. Aided Geom. Des.2
2025 High-quality neural surface reconstruction from unoriented point clouds via multilevel tensor product B-spline hash encoding and viscosity regularization
Yixiao Feng, Weihua Tong, Zhangjin Huang
Vis. Comput.2
2021 A sufficient condition for 3D typical curves
Weihua Tong
Comput. Aided Geom. Des.1
2020 Spectral Mesh Segmentation via ℓ0 Gradient Minimization
abstract
Mesh segmentation is a process of partitioning a mesh model into meaningful parts - a fundamental problem in various disciplines. This paper introduces a novel mesh segmentation method inspired by sparsity pursuit. Based on the local geometric and topological information of a given mesh, we build a Laplacian matrix whose Fiedler vector is used to characterize the uniformity among elements of the same segment. By analyzing the Fiedler vector, we reformulate the mesh segmentation problem as a ℓ0gradient minimization problem. To solve this problem efficiently, we adopt a coarse-to-fine strategy. A fast heuristic algorithm is first devised to find a rational coarse segmentation, and then an optimization algorithm based on the alternating direction method of multiplier (ADMM) is proposed to refine the segment boundaries within their local regions. To extract the inherent hierarchical structure of the given mesh, our method performs segmentation in a recursive way. Experimental results demonstrate that the presented method outperforms the state-of-the-art segmentation methods when evaluated on the Princeton Segmentation Benchmark, the LIFL/LIRIS Segmentation Benchmark and a number of other complex meshes.
Weihua Tong, Xiankang Yang, Maodong Pan, Falai Chen
IEEE Trans. Vis. Comput. Graph.1
2018 Low-rank parameterization of planar domains for isogeometric analysis
Maodong Pan, Falai Chen, Weihua Tong
Comput. Aided Geom. Des.3
2017 Phase-field guided surface reconstruction based on implicit hierarchical B-splines
Maodong Pan, Weihua Tong, Falai Chen
Comput. Aided Geom. Des.2
2016 Compact implicit surface reconstruction via low-rank tensor approximation
Maodong Pan, Weihua Tong, Falai Chen
Comput. Aided Des.2
2013 Cost-effective printing of 3D objects with skin-frame structures
abstract
3D printers have become popular in recent years and enable fabrication of custom objects for home users. However, the cost of the material used in printing remains high. In this paper, we present an automatic solution to design a skin-frame structure for the purpose of reducing the material cost in printing a given 3D object. The frame structure is designed by an optimization scheme which significantly reduces material volume and is guaranteed to be physically stable, geometrically approximate, and printable. Furthermore, the number of struts is minimized by solving an l 0 sparsity optimization. We formulate it as a multi-objective programming problem and an iterative extension of the preemptive algorithm is developed to find a compromise solution. We demonstrate the applicability and practicability of our solution by printing various objects using both powder-type and extrusion-type 3D printers. Our method is shown to be more cost-effective than previous works.
Weiming Wang 0003, Tuanfeng Y. Wang, Zhouwang Yang, Ligang Liu 0001, Xin Tong 0001, Weihua Tong, Jiansong Deng, Falai Chen, Xiuping Liu
ACM Trans. Graph.6
2008 Polynomial splines over hierarchical T-meshes
Jiansong Deng, Falai Chen, Xin Li 0021, Changqi Hu, Weihua Tong, Zhouwang Yang, Yu-Yu Feng 0001
Graph. Model.5