R. C. Chang

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Improving the characterization of the alternative hypothesis via minimum verification error training with applications to speaker verification Pattern Recognition	2009-05-07	Paper
OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS Parallel Algorithms and Applications	2004-10-06	Paper
Effects of a viscoelastic substrate on a cracked body under in-plane concentrated loading Acta Mechanica	2003-02-19	Paper
EJVM: An economic Java run-time environment for embedded devices Software. Practice & Experience	2001-06-27	Paper
REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON International Journal of Computational Geometry & Applications	1994-05-18	Paper
scientific article; zbMATH DE number 278832 (Why is no real title available?)	1994-01-06	Paper
The searching over separators strategy to solve some NP-hard problems in subexponential time Algorithmica	1993-06-29	Paper
The slab dividing approach to solve the Euclidean \(P\)-center problem Algorithmica	1993-04-01	Paper
scientific article; zbMATH DE number 140474 (Why is no real title available?)	1993-03-28	Paper
Special subgraphs of weighted visibility graphs Information Processing Letters	1993-01-17	Paper
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS International Journal of Computational Geometry & Applications	1993-01-16	Paper
covering grid points in a convex polygon with straight lines^∗ International Journal of Computer Mathematics	1992-06-28	Paper
scientific article; zbMATH DE number 30302 (Why is no real title available?)	1992-06-27	Paper
On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces Computing	1991-01-01	Paper
On the minimality of polygon triangulation BIT	1990-01-01	Paper
An upper bound for the average length of the euclidean minimum spanning tree International Journal of Computer Mathematics	1989-01-01	Paper
An O(N log N) minimal spanning tree algorithm for N points in the plane BIT	1986-01-01	Paper
On the average length of Delaunay triangulations BIT	1984-01-01	Paper
The average performance analysis of a closest‐pair algorithm International Journal of Computer Mathematics	1984-01-01	Paper

Research outcomes over time

This page was built for person: R. C. Chang