Skip navigation
  • Browse
      • Publications

      • Books
      • Articles
      • Conferences Paper
      • Research Plans
      • Thesis
      • Patents
      • Technical Report
      • Digital Teaching Material

      • Open Course Ware
      • Thematic Works

      • Cast Net
      • ARCH NCTU
      • MingZhu
      • Activities

      • Library Week
      • Research Guide Camp
      • Graduation Ceremony
      • Opening Ceremony
      • Digital Archives

      • Yuyu Yang Digital Art Museum
      • Kuan Digital Art Museum
      • Historical News

      • NCTU e-News
      • POiNT
      • NYCU E-NEWS
      • NYCU E-NEWS
      • YMNEWS
      • Campus Publications

      • NCTU Press
      • Technology Law Review
      • Journal of Management and System
      • Hakka People
      • Global Hakka Studies
      • Du:Chuan Bo Yu Ke Ji
      • Journal of Cyber Culture and Information Society
      • CS @ NCTU
      • Chiao Da Mangement Review
      • Mathematics, Science, History, and Culture
      • Science Bulletin National Chiao-Tung University
      • The Journal of National Chiao Tung University
      • Chiao Tung Youth Club
      • Journal of Chiao Da Physical Education
      • 陽明神農坡彙訊
      • Center for Institutional Research and Data Analytics Newsletter
      • Renjian Thought Review
      • Router: A Journal of Cultural Studies
      • 萌牙會訊
      • Inter-Asia Cultural Studies
      • 醫學院年報
      • 醫學院季刊
      • iPharm NYCU Journal
      • Sustainable Development Annual Report
      • Open House
      • School Yearbooks

      • Yearbook
  • Items
    • Issue Date
    • Author
    • Title
    • Subject
  • Researchers
  • English
  • 繁體
  • 简体
  1. You are Here:National Chiao Tung University Institutional Repository
  2. Publications
  3. Thesis

標題: 一些多邊形可見性問題之平行演算法
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


Related Contents
  • IR@NYCU
  • CrossRef
  • 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...

Items with full text/Total items : 82839/160690 (52%)
Visitors : 0      Online Users : 1

Copyright  ©  2002-2025   - Feedback - 
Powered by DSpace - Sitemap -  GitHub -  Sign on to:

Top
引用(Cite)
APA 許., 李., & 張. (1991). 一些多邊形可見性問題之平行演算法. http://hdl.handle.net/11536/56422.
Bibtex @article{1991,
    title={一些多邊形可見性問題之平行演算法},
    author={許芳榮 and 李家同 and 張瑞川},
    journal={http://hdl.handle.net/11536/56422},
    year={1991},
    url={https://ir.lib.nycu.edu.tw/handle/11536/56422?locale=en},
}