| 標題: | 一些多邊形可見性問題之平行演算法 Some Parallel Algorithms for polygon Visibility Problems |
| 作者: | 許芳榮 李家同 張瑞川 資訊科學與工程研究所 |
| 公開日期: | 1991 |
| URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT804392003 http://hdl.handle.net/11536/56422 |
| Appears in Collections: | Thesis |
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS / Hsu, F. R.;Chang, R. C.;Lee, R. C. T.
- TERRAIN EXPLORATION OF A SENSOR-BASED ROBOT MOVING AMONG UNKNOWN OBSTACLES OF POLYGONAL SHAPE / CHEN, Z;HUANG, CM
- Polygon-to-object boundary clipping in object space for hidden surface removal in computer-aided design / Chieng, WH;Hoeltzel, DA
- Polygon-to-object boundary clipping in object space for hidden surface removal in computer-aided design / Chieng, WH;Hoeltzel, DA
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON / Lee, Hsuan-Shih;Chang, Ruei Chuan
- A necessary condition for a graph to be the visibility graph of a simple polygon / Chen, CY
Loading...