R. C. Chang

According to our database, R. C. Chang authored at least 8 papers between 1974 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1993

Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments.

Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee

Parallel Algorithms Appl., 1993

The Slab Dividing Approach To Solve the Euclidean P-Center Problem.

R. Z. Hwang, Richard C. T. Lee, R. C. Chang

Algorithmica, 1993

The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time.

R. Z. Hwang, R. C. Chang, Richard C. T. Lee

Algorithmica, 1993

1992

Special Subgraphs of Weighted Visibility Graphs.

Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang

Inf. Process. Lett., 1992

Parallel algorithms for computing the closest visible vertex pair between two polygons.

Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee

Int. J. Comput. Geom. Appl., 1992

1986

An <i>O</i>(<i>N</i> log <i>N</i>) Minimal Spanning Tree Algorithm for <i>N</i> Points in the Plane.

R. C. Chang, Richard C. T. Lee

BIT, 1986

1984

On the Average Length of Delaunay Triangulations.

R. C. Chang, Richard C. T. Lee

BIT, 1984

1974

Sequential Stopping Rules for Fixed-Sample Acceptance Tests.

R. C. Chang, Sylvain Ehrenfeld

Oper. Res., 1974