Combinatorial Shape Decomposition

13 years 10 months ago

Download web.cecs.pdx.edu

We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.

Ralf Juengling, Melanie Mitchell

Real-time Traffic

Combinatorial Optimization Problem | Dynamic Programming Algorithm | ISVC 2007 | Two-dimensional Shapes |

claim paper

Related Content

» Table design in dynamic programming

» DeformationDriven Shape Correspondence

» Polygon decomposition based on the straight line skeleton

» Arrangements in Geometry Recent Advances and Challenges

» Recognition Algorithm for DiamondFree Graphs

» Convex Shape Decomposition

» Computing and Visualizing a GraphBased Decomposition for Nonmanifold Shapes

» Strategies for shape matching using skeletons

» Combinatorial and computational aspects of graph packing and graph decomposition

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISVC
Authors	Ralf Juengling, Melanie Mitchell

Comments (0)

Sciweavers

Combinatorial Shape Decomposition

Combinatorial Optimization Problem | Dynamic Programming Algorithm | ISVC 2007 | Two-dimensional Shapes |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers