Download presentation
Presentation is loading. Please wait.
1
Traversing the Machining Graph Danny Chen, Notre Dame Rudolf Fleischer, Li Jian, Wang Haitao,Zhu Hong, Fudan Sep,2006
2
2D-Milling
3
Example [Arkin,Held,Smith’00] Zigzag machining
4
Example [Tang,Joneja’03]:
5
Example [Tang,Joneja’03]:
6
The Model
8
We are stuck Non-compulsory edge (be traversed at most once) Compulsory edge (be traversed exactly once)
9
The Model We are stuck: jump
10
The Model Goal: minimize jumps
11
Greedy?
14
2 jumps
15
Greedy?
17
2 jumps
18
Greedy?
19
1 jump
20
Greedy? 1 jump
21
Greedy? 2 jumps
22
Greedy? 1 jump
23
Greedy? 1 jump
24
Greedy?
26
no jump
27
Greedy? May be exponential
28
What is Known Simple polygon: NP-hard? Some heuristics [Held’91, Tang,Chou,Chen’98] Polygon with h holes: NP-hard [Arkin,Held,Smith’00] 5OPT+6h jumps [AHS’00] Opt+h+N jumps [Tang,Joneja’03]
29
What we Show Simple polygon: NP-hard? No, linear time (DP) Some heuristics [Held’91, Tang,Chou,Chen’98] Polygon with h holes: NP-hard [Arkin,Held,Smith’00] 5OPT+6h jumps [AHS’00] Opt+h+N jumps [Tang,Joneja’03] OPT+εh jumps in polynomial time Opt jumps in linear+O(1) O(h) time (DP)
30
lemma Lemma [Arkin,Held,Smith’00]: There exists a optimal solution s.t. (1) every path starts and ends with compulsory edges. (2) No two non-compulsory edges are traversed consecutively. (alternating lemma)
31
Simple Pocket: The Dual Tree
32
Simple Pocket: Dynamic Programming start at the leaves
33
Simple Pocket: Dynamic Programming
34
Dynamic Programming Does path end here? 5 cases constant time per node
35
Polygon with h Holes time O(n)+O(1) O(h)
36
Polygon with h Holes Identify O(h) pivotal nodes.
37
Polygon with h Holes Using arbitrary strategy to cut all the cycles gives a (O(1)^O(h))*O(n) algorithms. Identify O(h) pivotal node whose removal s.t. 1.break all cycles. 2.each remaining (dual) tree is adjacent to O(1) pivotal nodes. Then, we can do it in (O(1)^O(h))+O(n) time.
38
Polygon with h Holes: Boundary graph
39
Polygon with h Holes: Minimum Restrict Path Cover Boundary graph Original Pocket Forbidden pairs: (e_1,e_4) and (e_2,e_3) e_1e_2 e_4e_3
40
A valid path: no forbidden pairs appear in one path. MRPC: find min # valid paths cover all vertices. Polygon with h Holes: Minimum Restrict Path Cover
41
Graph with Bounded Tree Width (informal) Polygon with h Holes: Minimum Restrict Path Cover Tree Graph with bound treewidth O(1) communicatons 1 communicaton
42
Polygon with h Holes: Minimum Restrict Path Cover(MRPC) It turns out MRPC can be solved in linear time by dynamic programming if the boundary graph has bounded treewidth. (assume its tree-decomposition is given) Remark: If tree-decomposition is not given, find 3-approximation to treewidth in time O(n log n). [Reed’92]
43
Polygon with h Holes: k-outerplanar graph:
44
Polygon with h Holes: k-outerplanar graph: Peel off the outer layer
45
Polygon with h Holes: k-outerplanar graph: Peel off the outer layer Peel again
46
Polygon with h Holes: k-outerplanar graph: Theorem: if a graph is k-outerplanar, it has treewidth 3k-1. [Bodlaender’88] Peel off the outer layer Peel again --nothing left… A 3-outplanar graph
47
Polygon with h Holes Lemma: (1) If dual graph has a bounded treewidth and bounded degree, its corresponding boundary graph has bounded treewidth. (2) If dual graph is a k-outplanar graph, its corresponding boundary graph is a 2k-outerplanar graph.
48
Thus, if the dual graph is (1) a graph with bounded treewidth and bounded degree, or (2)a k-outerplanar graph, MRPC can be solved in polynomial time. Polygon with h Holes
49
Cut: Polygon with h Holes Approximation for general planar graphs Original Pocket After cut
50
Cut an edge (in the dual): Polygon with h Holes Approximation for general planar graphs Original dual After cut
51
Polygon with h Holes Approximation for general planar graphs Decompose dual into a series of k-outerplanar graph k Baker’s technique
52
Polygon with h Holes Approximation for general planar graphs Decompose dual into a series of k-outerplanar graph by cutting edges
53
Intuitively, cutting one edge reduce the number of face by one. use 2h/k cuts to decompose the dual (planar) graph into series of (k+1)- outerplanar graphs Polygon with h Holes Approximation for general planar graphs
54
solve these (k+1)-outerplanar graphs optimally, then put solutions together for a solution with at most OPT+4h/k jumps choose k=4/ε OPT+εh jumps in polynomial time Polygon with h Holes Approximation for general planar graphs
55
Thank You!
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.