A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs

Meng Cheng Lau*, Jacky Baltes, John Anderson, Stephane Durocher

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

5 引文 斯高帕斯(Scopus)

摘要

We examine the problem of estimating ideal edges joining points in a pixel reduction image for an existing point-to-point portrait drawing humanoid robot, Betty. To solve this line drawing problem we present a modified Theta-graph, called Furthest Neighbour Theta-graph, which we show is computable in O(n(log n)/θ) time, where θ is a fixed angle in the graph's definition. Our results show that the number of edges in the resulting drawing is significantly reduced without degrading the detail of the final output image.

原文英語
主出版物標題AIM 2012 - 2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, Conference Digest
頁面75-79
頁數5
DOIs
出版狀態已發佈 - 2012 十月 5
事件2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012 - Kaohsiung, 臺灣
持續時間: 2012 七月 112012 七月 14

出版系列

名字IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM

其他

其他2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012
國家/地區臺灣
城市Kaohsiung
期間2012/07/112012/07/14

ASJC Scopus subject areas

  • 控制與系統工程
  • 軟體
  • 電腦科學應用
  • 電氣與電子工程

指紋

深入研究「A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs」主題。共同形成了獨特的指紋。

引用此