Demo Data from EDBT 2026 / reviewers in the wild / expert
Hongxu Xin
dblp:421/5730
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0008-2532-7428ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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 · 67% Visual content generation and editing · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visual content generation and editing › image colorization
line art colorization |
0.9 | 1 | 2025 | KISSColor: Kinetic and Intuitive Stroke Stretching for Vector Drawing Colorization · ACM Trans. Graph. 2025 |
Geometric modeling and processing › shape representation
vector graphics |
0.9 | 1 | 2025 | KISSColor: Kinetic and Intuitive Stroke Stretching for Vector Drawing Colorization · ACM Trans. Graph. 2025 |
Methods — techniques the papers use, named apart from their topics
winding-number fields · 0.9mixed-integer programming · 0.9kinetic data structures · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | KISSColor: Kinetic and Intuitive Stroke Stretching for Vector Drawing ColorizationabstractHand-drawn vector sketches often contain implied lines, imprecise intersections, and unintended gaps, making it challenging to identify closed regions for colorization. These challenges become more pronounced as the number of strokes increases. In this paper, we present KISSColor, a novel method for inferring users' intended closed regions. Specifically, we propose intuitive stroke stretching by extending open strokes along tangent isolines of winding-number fields, which provably form geometrically aligned closed regions. Extending all open strokes can lead to overly fragmented regions due to redundant intersections. While a Mixed Integer Programming (MIP) formulation helps reduce redundancy, it is computationally expensive. To improve efficiency, we introduce kinetic stroke stretching, which grows all strokes simultaneously and prioritizes early intersections using a kinetic data structure. This approach preserves stylistic ambiguity for lines requiring long extensions. Based on the growth results, redundant regions are suppressed to minimize fragmentation. We conduct extensive experiments demonstrating the effectiveness of KISSColor, which generates more intuitive partitions, especially for imprecise sketches (see teaser figure). Our code and data will be released upon publication. Yiming Dong, Hongxu Xin, Zhiyang Dou, Rui Xu 0016, Yuan Liu 0025, Shuang-Min Chen, Shi-Qing Xin, Changhe Tu, Taku Komura, Wenping Wang 0001 |
ACM Trans. Graph. | 2 |