11 citations · 18 across the 2 of their papers we have counts for
2 papers
cs.CG2013★ 7 cited
Simple Curve Embedding
Jessica Sherette, Carola Wenk
Given a curve f and a surface S, how hard is it to find a simple curve f' in S that is the most similar to f? We introduce and study this simple curve embedding problem for piecewi…
cs.CG2011★ 11 cited
Computing the Fréchet Distance Between Folded Polygons
Atlas F. Cook, Anne Driemel, Sariel Har-Peled +2
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to…