| 1993 |
|---|
| 10 | | R. Z. Hwang,
Richard C. T. Lee,
R. C. Chang:
The Slab Dividing Approach To Solve the Euclidean P-Center Problem.
Algorithmica 9(1): 1-22 (1993) |
| 9 | | R. Z. Hwang,
R. C. Chang,
Richard C. T. Lee:
The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time.
Algorithmica 9(4): 398-423 (1993) |
| 8 | | H. S. Lee,
R. C. Chang:
Regular enumeration of grid points in a convex polygon.
Int. J. Comput. Geometry Appl. 3(3): 305-322 (1993) |
| 7 | EE | Fang-Rong Hsu,
R. C. Chang,
Richard C. T. Lee:
Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments.
Parallel Algorithms Appl. 1(2): 83-98 (1993) |
| 1992 |
|---|
| 6 | | H. S. Lee,
R. C. Chang:
Approximating Vertices of a Convex Polygon with Grid Points in the Polygon.
ISAAC 1992: 269-278 |
| 5 | | R. C. Chang,
H. S. Lee:
Finding a Maximum Set of Independent Chords in a Circle.
Inf. Process. Lett. 41(2): 99-102 (1992) |
| 4 | | Fang-Rong Hsu,
Richard C. T. Lee,
R. C. Chang:
Special Subgraphs of Weighted Visibility Graphs.
Inf. Process. Lett. 43(2): 69-75 (1992) |
| 3 | | Fang-Rong Hsu,
R. C. Chang,
Richard C. T. Lee:
Parallel algorithms for computing the closest visible vertex pair between two polygons.
Int. J. Comput. Geometry Appl. 2(2): 135-162 (1992) |
| 1986 |
|---|
| 2 | | R. C. Chang,
Richard C. T. Lee:
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane.
BIT 26(1): 7-16 (1986) |
| 1984 |
|---|
| 1 | | R. C. Chang,
Richard C. T. Lee:
On the Average Length of Delaunay Triangulations.
BIT 24(3): 269-273 (1984) |
