Li Jin
|
I am currently a Postdoc of computer science at Tsinghua University.
Graphics and Geometric Computing Group Department of Computer Science and Technology Tsinghua University |
|
Contact Info
Office: Room 9-217, East Main Building, Tsinghua University.
Tel:86-10-62797231
<%--Fax:86-10-62771138
--%>
Email:jinl@cg.cs.tsinghua.edu.cn
Education
| 1999.9-2003.7 | Department of Computer Science and Technology, Tsinghua University | Bachlor Degree | |
| 2003.9-2008.6 | Computational Geometry and Graphics, Department of Computer Science and Technology, Tsinghua University | Ph.D Candidate |
Work Experience
| 1996.6-1998.3 | Department of Computer Science and Technology, Tsinghua University | Postdoctor | |
| 1998.3-1999.6 | Department of Computer Science and Technology, Tsinghua University | Lecturer | |
| 1999.6-2002.12 | Department of Computer Science and Technology, Tsinghua University | Associate Profesor | |
| 2002.12- present | Department of Computer Science and Technology, Tsinghua University | Professor |
Research Area
- Geometric Computing
- Computer Graphics
- Bioinformatics
Professional Service
- Editorial Board, Computer-Aided Design
- Editorial Board, Journal of Information and Computational Science
- Editorial Board, International Journal of CAD/CAM
- Program Co-Chair of Pacific Graphics 2002
- Program Committee Member of Pacific Graphics 2000, 2001, 2003, 2004, 2005, 2006
- Program Co-Chair of Geometric Modeling and Processing 2004
- Program Committee Member of Geometric Modeling and Processing 2002, 2006
- Program Committee Member of Shape Modeling international 2003
- Program Committee Member of ACM Solid and Physical Modeling 2005
- Conference Co-Chair of ACM Solid and Physical Modeling 2006, 2007
- Program Co-Chair of Pacific-Rim Conference on Multimedia (PCM) 2007
Publications
2006
 |  | |
 |
||
 |  |
A Sweepline Algorithm for Euclidean Voronoi Diagram of Circles
Computer-Aided Design, 2006, Vol. 38, No. 3, 260-278.
Li Jin, Donguk Kim, Lisen Mu, Deok-Soo Kim and Shi-Min Hu
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bottom. While moving on the plane, the sweepline stops only at certain event points where the topology changes occur for the Voronoi diagram being constructed. The worst-case time complexity of the proposed algorithm is O((nCm)log n), where n is the number of input circles, and m is the number of intersection points among circles. As m can be O(n2), the presented algorithm is optimal with O(n2 log n) worst-case time complexity.
Software
RegDock: A software for molecular surface matching / docking using registration method.
Link
Web News from CSDN.