Combinatorial shape decomposition

Authors:
Ralf Juengling;Melanie Mitchell
Affiliations:
Department of Computer Science, Portland State University, Portland, Oregon;Department of Computer Science, Portland State University, Portland, Oregon
Venue:
ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II
Year:
2007

Citing 8
Cited 2

Three-dimensional object recognition from single two-dimensional images

Artificial Intelligence
FORMS: a flexible object recognition and modeling system

International Journal of Computer Vision
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
Convexity rule for shape decomposition based on discrete contour evolution

Computer Vision and Image Understanding
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Rectification of the chordal axis transform and a new criterion for shape decomposition

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Shape partitioning by convexity

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

SMI 2012: Full α-Decomposition of polygons

Computers and Graphics
Fast approximate convex decomposition using relative concavity

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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