Sciweavers

Share
TVCG
2011

Interactive Mesh Cutting Using Constrained Random Walks

11 years 9 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorithm that can add constraints to the random walks procedure and thus allows for a variety of intuitive user inputs. Second, we design an optimization process that uses the shortest graph path to derive a nice cut contour. Then a new mesh cutting algorithm is developed based on the constrained random walks plus the optimization process. Within the same computational framework, the new algorithm provides a novel user interface for interactive mesh cutting that supports three typical user inputs and also their combinations: 1) foreground/background seed inputs: the user draws strokes specifying seeds for “foreground” (i.e., the part to be cut out) and “background” (i.e., the rest); 2) soft constraint inputs: the user draws strokes on the mesh indicating the region which the cuts should be made nearby; and 3...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
Added 17 May 2011
Updated 17 May 2011
Type Journal
Year 2011
Where TVCG
Authors Juyong Zhang, Jianmin Zheng, Jianfei Cai
Comments (0)
books