An Optimum Convex Decomposition Algorithm of Simple Polygon Based on Its Adjacent Concave Vertex Connection

2011 ◽  
Author(s):  
Jinhui Dong
Keyword(s):  
Simple Polygon ◽  
Decomposition Algorithm ◽  
Convex Decomposition ◽  
Concave Vertex

ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS

2002 ◽  
Vol 12 (03) ◽  
pp. 181-192 ◽  
Author(s):  
MARK KEIL ◽  
JACK SNOEYINK
Keyword(s):  
Simple Polygon ◽  
Time And Space ◽  
Convex Decomposition ◽  
Simple Polygons ◽  
Minimum Number

We show that a decomposition of a simple polygon having n vertices, r of which are reflex, into a minimum number of convex regions without the addition of Steiner vertices can be computed in O(n + r2 min {r2, n}) time and space. A Java demo is available at .

Optimum packing of rectangles based on heuristic dynamic decomposition algorithm

2013 ◽  
Vol 33 (7) ◽  
pp. 1908-1911
Author(s):  
Bo LI ◽  
Shi WANG ◽  
Songxin SHI ◽  
Junyong HU
Keyword(s):  
Decomposition Algorithm ◽  
Dynamic Decomposition
Sign in / Sign up

Export Citation Format

Share Document