Sheung-Hung Poon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sheung-Hung Poon has a total of 112 co-authors. Here are the top co-authors by number of shared publications:
Ton Kloks
11 shared publicationsYue-Li Wang
7 shared publicationsChing-Hao Liu
5 shared publications- Alexander Wolff
Universität Würzburg
4 shared publications - Chun-Cheng Lin
National yang Ming Chiao Tung University
4 shared publications Naoki Katoh
4 shared publications
Latest Publications
- 1 January 2018
- Published by Elsevier in Information Processing Letters
- Vol. 129, 25-30
Line segment covering of cells in arrangements
- 1 January 2018
- Published by Elsevier in Information Processing Letters
- Vol. 129, 25-30
Line segment covering of cells in arrangements
- 31 May 2017
- Published by Springer Nature
- p. 117-130
Introducing Leader Lines into Scale-Aware Consistent Labeling
- 31 May 2017
- Published by Springer Nature
- p. 117-130
Introducing Leader Lines into Scale-Aware Consistent Labeling
- 21 March 2017
- Published by Springer Nature
- p. 515-528
On Complexity of Total Vertex Cover on Subcubic Graphs
- 21 March 2017
- Published by Springer Nature
- p. 515-528
On Complexity of Total Vertex Cover on Subcubic Graphs
- 21 March 2017
- Published by Springer Nature
- p. 247-259
Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity
- 21 March 2017
- Published by Springer Nature
- p. 247-259
Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity
- 21 February 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 243-253
Online Inserting Points Uniformly on the Sphere
- 21 February 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 243-253
Online Inserting Points Uniformly on the Sphere
- 21 October 2016
- Published by Springer Nature
- p. 60-71
Rides for Rewards (R4R): A Mobile Application to Sustain an Incentive Scheme for Public Bus Transport
- 21 October 2016
- Published by Springer Nature
- p. 60-71
Rides for Rewards (R4R): A Mobile Application to Sustain an Incentive Scheme for Public Bus Transport
- 22 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 61-66
Interpolation between Outline Font Characters
Outline fonts use Bezier curves to describe the outer boundaries of the characters of specific outline fonts. In this paper, we consider the interpolation problem between two different but quite similar outline fonts. Since the compositions of different outline fonts of a character may be different, such as the total number of curves a font of the character contains, and the endpoints of curve segments of different fonts of the character possess may be different, it is not straightforward to directly perform the interpolation between two different outline fonts of a specific character. Consequently, a pretty simple and efficient method is thus proposed to perform the interpolation between two different fonts of a character. Such resulting interpolated font characters can be considered as a newly designed font. Our experimentation shows that our algorithm to compute such an interpolated font is effective and efficient.
- 22 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 61-66
Interpolation between Outline Font Characters
Outline fonts use Bezier curves to describe the outer boundaries of the characters of specific outline fonts. In this paper, we consider the interpolation problem between two different but quite similar outline fonts. Since the compositions of different outline fonts of a character may be different, such as the total number of curves a font of the character contains, and the endpoints of curve segments of different fonts of the character possess may be different, it is not straightforward to directly perform the interpolation between two different outline fonts of a specific character. Consequently, a pretty simple and efficient method is thus proposed to perform the interpolation between two different fonts of a character. Such resulting interpolated font characters can be considered as a newly designed font. Our experimentation shows that our algorithm to compute such an interpolated font is effective and efficient.
- 1 August 2016
- Published by Elsevier in Theoretical Computer Science
- Vol. 640, 84-93
Approximation algorithms on consistent dynamic map labeling
- 1 August 2016
- Published by Elsevier in Theoretical Computer Science
- Vol. 640, 84-93
Approximation algorithms on consistent dynamic map labeling
- 1 January 2016
- Published by Elsevier in Computational Geometry
- Vol. 51, 15-24
On the edge crossing properties of Euclidean minimum weight Laman graphs
- 1 January 2016
- Published by Elsevier in Computational Geometry
- Vol. 51, 15-24
On the edge crossing properties of Euclidean minimum weight Laman graphs