TBR: Transport-Based Rendering with Deposition Strokes for Inverse Graphics
Updated 51 min ago · first seen 11 Sept 2026
paper_01M294H48EWDC1KP6Z64BYH2ZQ
- Published
- 11 Sept 2026
- T1 · 51 min ago
- arXiv
- 2609.08722
- T1 · 51 min ago
- Category
- cs.GR
- T1 · 51 min ago
Abstract
-cross Abstract: We present a stroke design in which strokes are transport-coupled: each stroke deposits material of its own area and moves every earlier mark without changing its area, so later strokes deform earlier ones. We then solve the inverse problem under this design: given a target image, we optimise an ordered program of such strokes whose replay approximates it, with digital marbling as the motivating medium. The stroke is a capsule that continuously joins circular drops to drawn deposits; its transport is exactly area-preserving, with a closed-form inverse outside the deposit, and a variant with the same inverse differs from line-source potential flow by 8% of the mean displacement. A replay adjoint regenerates intermediate states instead of storing them and uses 8.7x less memory than checkpointed automatic differentiation; a fused implementation fits a 2000-stroke program at 1024x1024 in about four minutes on one GPU. On five marbled sheets the recovered programs are level with a published stroke-based fitter as rasters, replay across a fourfold resolution range, and support edits in program order and palette space that stay valid under transport.
Authors 3
Tianqi Liu, Yushan Han, Hang Liu
Specification
- Official page
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
- Arxiv announce type
- replace
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
- arXiv id
- 2609.08722
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
- Categories
- cs.GR, cs.CV
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
- Primary category
- cs.GR
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
- Published
- 11 Sept 2026
Source:arXiv (Atom API + RSS)T1observed 51 min agohigh
Each value shows its source, tier and observation time. Conflicting claims are kept side by side and flagged — never averaged. How AI Atlas records facts →
Provenance
Attributed facts
9
Source tiers
T19
Freshest observation
51 min ago
Conflicts
None
No models linked to this paper yet.
- Authors
- Tianqi Liu, Yushan Han, Hang Liu
As of
Rewind the record: see this entity's attributes exactly as AI Atlas knew them on a given day.
Claim history
Official pageofficial_url1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| https://arxiv.org/abs/2609.08722 | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Abstractabstract1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| -cross Abstract: We present a stroke design in which strokes are transport-coupled: each stroke deposits material of its own area and moves every earlier mark without changing its area, so later strokes deform earlier ones. We then solve the inverse problem under this design: given a target image, we optimise an ordered program of such strokes whose replay approximates it, with digital marbling as the motivating medium. The stroke is a capsule that continuously joins circular drops to drawn deposits; its transport is exactly area-preserving, with a closed-form inverse outside the deposit, and a variant with the same inverse differs from line-source potential flow by 8% of the mean displacement. A replay adjoint regenerates intermediate states instead of storing them and uses 8.7x less memory than checkpointed automatic differentiation; a fused implementation fits a 2000-stroke program at 1024x1024 in about four minutes on one GPU. On five marbled sheets the recovered programs are level with a published stroke-based fitter as rasters, replay across a fourfold resolution range, and support edits in program order and palette space that stay valid under transport. | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Arxiv announce typearxiv_announce_type1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| replace | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
arXiv idarxiv_id1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| 2609.08722 | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Categoriescategories1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| cs.GR, cs.CV | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
PDFpdf_url1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| https://arxiv.org/pdf/2609.08722 | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Primary categoryprimary_category1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| cs.GR | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Publishedpublished_at1
| Value | Valid from → to | Status | Source | Confidence | Extractor |
|---|---|---|---|---|---|
| 11 Sept 2026 | → current | current | arXiv (Atom API + RSS)T1 | high | deterministic |
Claims are temporal and append-only: a new observation closes the previous claim (valid_to) instead of overwriting it. Conflicting claims from different sources are kept side by side and flagged — never averaged. Methodology →
New paper: TBR: Transport-Based Rendering with Deposition Strokes for Inverse Graphics
arxiv
| Source | Document | Type | Tier | Last observed | Snapshots |
|---|---|---|---|---|---|
| arXiv (Atom API + RSS) | rss.arxiv.org/rss/cs.CV | feed | T1· Official | 51 min ago | 1 |
Tier 1 = official/primary, 2 = quality secondary, 3 = community, 4 = unverified. Every snapshot is archived; see all sources and the methodology.