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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAIM 2012 - 2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, Conference Digest
Pages75-79
Number of pages5
DOIs
Publication statusPublished - 2012 Oct 5
Event2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012 - Kaohsiung, Taiwan
Duration: 2012 Jul 112012 Jul 14

Publication series

NameIEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM

Other

Other2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012
CountryTaiwan
CityKaohsiung
Period12/7/1112/7/14

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs'. Together they form a unique fingerprint.

Cite this