EDBT 2026 Demo / reviewers in the wild / expert
Linxuan Rong
dblp:313/2205
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0004-7955-0351ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
1 paper |
Geometric modeling and processing · 77% Visualization and visual analytics · 23% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › topology › computational topology
topological simplification |
1.0 | 1 | 2026 | Persistence-guided Prescribed Topological Simplification · ACM Trans. Graph. 2026 |
Visualization and visual analytics › topological data analysis
persistent homology |
0.3 | 1 | 2026 | Persistence-guided Prescribed Topological Simplification · ACM Trans. Graph. 2026 |
Methods — techniques the papers use, named apart from their topics
weighted independent set · 1.0iterative candidate selection · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Persistence-guided Prescribed Topological SimplificationabstractWe present a new method for simplifying the topology of a 3D shape. Unlike existing methods that either remove all topological features or offer indirect control over the target topology, our method aims at exactly preserving the user-prescribed numbers of topological features of each type (e.g., components, handles, and voids), while making minimal geometric changes. Guided by persistent homology , our method removes features with low persistence by performing either cutting or filling. This is achieved by an algorithm for computing candidate cuts and fills that remove only low-persistence features, an efficient algorithm for selecting an optimal subset of candidates by computing a weighted independent set, and an iterative framework that alternates between candidate computation and selection. Our method is shown to be highly successful in achieving the prescribed topology on a large test suite involving many complex 3D shapes and target topologies. Linxuan Rong, Tao Ju 0001 |
ACM Trans. Graph. | 1 |
| 2023 | Variational Pruning of Medial Axes of Planar ShapesabstractAbstract Medial axis (MA) is a classical shape descriptor in graphics and vision. The practical utility of MA, however, is hampered by its sensitivity to boundary noise. To prune unwanted branches from MA, many definitions of significance measures over MA have been proposed. However, pruning MA using these measures often comes at the cost of shrinking desirable MA branches and losing shape features at fine scales. We propose a novel significance measure that addresses these shortcomings. Our measure is derived from a variational pruning process, where the goal is to find a connected subset of MA that includes as many points that are as parallel to the shape boundary as possible. We formulate our measure both in the continuous and discrete settings, and present an efficient algorithm on a discrete MA. We demonstrate on many examples that our measure is not only resistant to boundary noise but also excels over existing measures in preventing MA shrinking and recovering features across scales. Linxuan Rong, Tao Ju 0001 |
Comput. Graph. Forum | 1 |