2013
DOI: 10.1109/mcg.2012.124
|View full text |Cite
|
Sign up to set email alerts
|

DPFrag: Trainable Stroke Fragmentation Based on Dynamic Programming

Abstract: Many computer graphics applications must fragment freehand curves into sets of prespecified geometric primitives. For example, sketch recognition typically converts hand-drawn strokes into line and arc segments and then combines these primitives into meaningful symbols for recognizing drawings. However, current fragmentation methods' shortcomings make them impractical. For example, they require manual tuning, require excessive computational resources, or produce suboptimal solutions that rely on local decision… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 6 publications
0
15
0
Order By: Relevance
“…here are DPFrag [26] and IStraw [28]. Due to the unavailability of other data, we only report the results related to the All-or-nothing metric.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…here are DPFrag [26] and IStraw [28]. Due to the unavailability of other data, we only report the results related to the All-or-nothing metric.…”
Section: Resultsmentioning
confidence: 99%
“…The algorithms also differ for the norm they use to measure the approximation error. A recent method, called DPFrag [26] learns primitivelevel models from data, in order to adapt fragmentation to specific datasets and to user preferences and sketching style.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations