Jie Xu  staple

Ph.D Candidate
Computer Graphics Lab
David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, ON, Canada, N2L 3G1
Email: jiexu at cgl.uwaterloo.ca
WWW: http://www.cgl.uwaterloo.ca/~jiexu
Tel: (o) 519-888-4567 x34548

I am a Ph.D student in the David R. Cheriton School of Computer Science, University of Waterloo, Canada.
My supervisor is Prof. Craig S. Kaplan.

Now, I am looking for a research or development job in industry! (my CV)

Education


Research Interests

My research interests lie in the field of computer graphics and computer arts, particularly in non-photorealistic rendering(NPR) and its applications.


Research Projects

thresholding
  Artistic Thresholding:
   We consider the problem of converting a color image to a “wholetoning” image. Unlike traditional halftoning, our “artistic thresholding” technique attempts to depict forms in an image. We apply segmentation to a source image and construct a planar subdivision captures segment connectivity. Our artistic thresholding algorithm is a combinatorial optimization over this graph. The optimization is controlled by parameters that can be tuned to achieve different artistic styles.




maze


  Computer-Generated Papercutting:
   Papercutting  is a folk art in many cultures. From the point of view of computer graphics, papercutting can be seen as a method of composing bi-level images under a set of geometric connectivity constraints. In this project, we present a technique for composing digital paper-cut designs. The elements of a design may be images, which are processed via a multi-layer thresholding operation, or they may be procedurally-generated arrangements of shapes. Elements are composed using a set of boolean operators that preserve connectivity. The resulting designs are well suited to being cut by a digital craft cutter to create real paper-cuts.



maze


  Calligraphic Packing:
  In this project, we focus on how to represent an image as a composition of letters. We develop a solution to the "calligraphics packing" problem based on dividing up a target region into pieces  and warping a letter into each piece. We define an energy function that chooses a warp that best represents the original letter. Some variations in rendering style are imported.





maze


 Maze Design:
  In this big project, we find there are several different textures in maze design. They are spiral and vortex mazes, directional mazes, and random mazes. Among them, spiral and vortex mazes are powerful obfuscating devices in maze design. We developed a simple algorithm for constructing vortices. With the help of basic maze textures, we present a set of graphical and combinatorial algorithms for designing mazes based on images. In our system, the designer traces regions of interest in an image and annotates the regions with style parameters. They can specify a solution path, which provides a rough guide for laying out the maze's actual solution. Then our system will build mazes that express the desired style in each region, and conform to the user's solution path automatically.


Publications

2008

2007

  • Jie Xu, Craig S. Kaplan, Xiaofeng Mi. Computer-generated papercutting.  In Pacific Graphics 2007, pages 343-350, 2007
  • [PDF] [Slides] [Project page]

  • Jie Xu, Craig S. Kaplan. Image-guided maze construction. In ACM Transactions on Graphics(Proceedings of SIGGRAPH 2007), 26(3):29, 2007
  • [PDF] [Project page]

  • Jie Xu, Craig S. Kaplan. Vortex maze construction. Journal of Mathematics and the Arts 1(1), pages 7-20, March 2007
  • [PDF] [Project page]

2006

  • Jie Xu, Craig S. Kaplan. Vortex maze construction. In Bridges 2006: Mathematical Connections in Art, Music, and Science, 2006
  • [PDF] [Project page]

  • Jie Xu, Craig S. Kaplan. Maze construction. Poster in Graphics Interface 2006, 2006

2005

  • Guofei Hu, Jie Xu, Lanfang Miao, Qunsheng Peng. Bilateral estimation of vertex normal for point-sampled models. In Computational Geometry and Applications(CGA05) Workshop, pages 758-768, 2005

Teaching


I have been a TA for these courses: CS488, CS349, CS251, CS245, CS134, CS131.


Courses


2004 Spring term:
CS860: Advanced Topics in Algorithms and Complexity: Computational Geometry

2004 Winter term:
CS688: Introduction to Computer Graphics (A4, Project)
CS798: Advanced Research Topics: Non-photorealistic Computer Graphics (Project)

2003 Fall term:
CS870: Advanced Topics in Scientific Computation: Computational Finance
CS888: Advanced Topics in Computer Graphics
CS697: Graduate Research Skills Seminar

Audit courses:
CS888: Advanced Topics in Computer Graphics
CS798: Computer Graphics, Geometry, and Ornamental Design
CS860: Algorithms for Polyhedra
CS860: Introduction to Kolmogorov Complexity and Its Applications


Resources


Friends


Xiaofeng MI, Eric Yu Chen, Yingbin Liu, Yi Lin, Jack's Canada Ink Cartridges Online Store