R. C. Chang

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

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Regular enumeration of grid points in a convex polygon.
Int. J. Comput. Geometry Appl., 1993

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

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

1992
Special Subgraphs of Weighted Visibility Graphs.
Inf. Process. Lett., 1992

Finding a Maximum Set of Independent Chords in a Circle.
Inf. Process. Lett., 1992

covering grid points in a convex polygon with straight lines.
Int. J. Comput. Math., 1992

Parallel algorithms for computing the closest visible vertex pair between two polygons.
Int. J. Comput. Geometry Appl., 1992

Approximating Vertices of a Convex Polygon with Grid Points in the Polygon.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1986
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane.
BIT, 1986

1984
On the Average Length of Delaunay Triangulations.
BIT, 1984

1974
Sequential Stopping Rules for Fixed-Sample Acceptance Tests.
Operations Research, 1974


  Loading...