| 2009 |
|---|
| 14 | EE | Fajie Li,
Reinhard Klette:
Recovery Rate of Clustering Algorithms.
PSIVT 2009: 1058-1069 |
| 2008 |
|---|
| 13 | EE | Fajie Li,
Reinhard Klette:
Calculating the Number of Tunnels.
CIARP 2008: 421-428 |
| 12 | EE | Fajie Li,
Reinhard Klette:
An Approximate Algorithm for Solving the Watchman Route Problem.
RobVis 2008: 189-206 |
| 2007 |
|---|
| 11 | EE | Fajie Li,
Reinhard Klette:
Euclidean Shortest Paths in Simple Cube Curves at a Glance.
CAIP 2007: 661-668 |
| 10 | EE | Fajie Li,
Reinhard Klette:
Decomposing a Simple Polygon into Trapezoids.
CAIP 2007: 726-733 |
| 9 | EE | Fajie Li,
Reinhard Klette:
Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems.
ICCTA 2007: 9-19 |
| 8 | EE | Fajie Li,
Reinhard Klette,
Xue Fu:
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm.
PSIVT 2007: 236-247 |
| 7 | EE | Fajie Li,
Reinhard Klette:
Euclidean Shortest Paths in Simple Cube Curves at a Glance
CoRR abs/0704.3197: (2007) |
| 6 | EE | Fajie Li,
Reinhard Klette:
Analysis of the rubberband algorithm.
Image Vision Comput. 25(10): 1588-1598 (2007) |
| 2006 |
|---|
| 5 | EE | Fajie Li,
Reinhard Klette:
Shortest Paths in a Cuboidal World.
IWCIA 2006: 415-429 |
| 4 | EE | Fajie Li,
Reinhard Klette:
Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm.
PSIVT 2006: 280-291 |
| 2005 |
|---|
| 3 | EE | Fajie Li,
Reinhard Klette:
Minimum-Length Polygons of First-Class Simple Cube-Curves.
CAIP 2005: 321-329 |
| 2 | EE | Fajie Li,
Reinhard Klette:
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points.
DGCI 2005: 183-194 |
| 2004 |
|---|
| 1 | EE | Fajie Li,
Reinhard Klette:
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space.
IWCIA 2004: 502-511 |
