查詢結果分析
來源資料
相關文獻
- Connectivity Preservation of 3D 6-subiteration Thinning Algorithms
- 臺灣地區小農經濟之衝擊分析--兼論亞洲地區農業之經濟衝擊課題
- 議題中心教學法在國中法治教育課程的應用--結構性爭論模式的實例
- CSA的利弊
- Unstructured Euler Computations Using Rotating Mesh for Rotors and Propellers
- The Structure of Commutative Algebra Has the Only One Regular Maximal Ideal
- 腹部手術患者手術前深呼吸咳嗽結構性衛教的效果
- 多點競爭之僵固性分析
- Quasi-Delaunay Unstructured Grid Generation
- 大人拓跋--拓跋氏的興起
頁籤選單縮合
題 名 | Connectivity Preservation of 3D 6-subiteration Thinning Algorithms=保持3D細化法則之結構性 |
---|---|
作 者 | 馬成珉; | 書刊名 | 明志工專學報 |
卷 期 | 27 1995.05[民84.05] |
頁 次 | 頁189-199 |
分類號 | 312.74 |
關鍵詞 | 3D細化法則; 結構性; |
語 文 | 英文(English) |
英文摘要 | Thinning is process which erodes an object layer by layer until only a skeleton is left. A thinning algorithm should preserve connectivity, i. e., any object and its skeleton should maintain the same connectivity structure. The first objective of this paper is to propose sufficient conditions so that any 3D 6-subiteration parallel thinning algorithm satisfying these conditions are guaranteed to preserve connectivity. Even with these sufficient conditions, it still may not be very easy to prove the connectivity soundness of a 3D 6-subiteration thinning algorithm. Thus, the second objective of this paper is to propose an approach to implement the above sufficient conditions. Any 3D 6-subiteration thinning algorithm passing the program is guaranteed to preserve connectivity. |
本系統中英文摘要資訊取自各篇刊載內容。