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

2 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 publicationIEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM
Pages75-79
Number of pages5
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012 - Kaohsiung
Duration: 11 Jul 201214 Jul 2012

Other

Other2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012
CityKaohsiung
Period11/7/1214/7/12

Fingerprint

Joining
Pixels
Robots

ASJC Scopus subject areas

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

Cite this

Lau, M. C., Baltes, J., Anderson, J., & Durocher, S. (2012). A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs. In IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM (pp. 75-79). [6265936] https://doi.org/10.1109/AIM.2012.6265936

A portrait drawing robot using a geometric graph approach : Furthest Neighbour Theta-graphs. / Lau, Meng Cheng; Baltes, Jacky; Anderson, John; Durocher, Stephane.

IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM. 2012. p. 75-79 6265936.

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

Lau, MC, Baltes, J, Anderson, J & Durocher, S 2012, A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs. in IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM., 6265936, pp. 75-79, 2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2012, Kaohsiung, 11/7/12. https://doi.org/10.1109/AIM.2012.6265936
Lau MC, Baltes J, Anderson J, Durocher S. A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs. In IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM. 2012. p. 75-79. 6265936 https://doi.org/10.1109/AIM.2012.6265936
Lau, Meng Cheng ; Baltes, Jacky ; Anderson, John ; Durocher, Stephane. / A portrait drawing robot using a geometric graph approach : Furthest Neighbour Theta-graphs. IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM. 2012. pp. 75-79
@inproceedings{643d085b106043b6bc8abff934128cbb,
title = "A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs",
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.",
author = "Lau, {Meng Cheng} and Jacky Baltes and John Anderson and Stephane Durocher",
year = "2012",
doi = "10.1109/AIM.2012.6265936",
language = "English",
isbn = "9781467325752",
pages = "75--79",
booktitle = "IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM",

}

TY - GEN

T1 - A portrait drawing robot using a geometric graph approach

T2 - Furthest Neighbour Theta-graphs

AU - Lau, Meng Cheng

AU - Baltes, Jacky

AU - Anderson, John

AU - Durocher, Stephane

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84866896396&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866896396&partnerID=8YFLogxK

U2 - 10.1109/AIM.2012.6265936

DO - 10.1109/AIM.2012.6265936

M3 - Conference contribution

AN - SCOPUS:84866896396

SN - 9781467325752

SP - 75

EP - 79

BT - IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM

ER -