The following pages link to Ruei-Chuan Chang (Q751275):
Displaying 19 items.
- On the minimality of polygon triangulation (Q751276) (← links)
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
- Improving the characterization of the alternative hypothesis via minimum verification error training with applications to speaker verification (Q1015197) (← links)
- (Q1062439) (redirect page) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- (Q2720894) (← links)
- The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
- An upper bound for the average length of the euclidean minimum spanning tree (Q3833626) (← links)
- (Q3985351) (← links)
- covering grid points in a convex polygon with straight lines<sup>∗</sup> (Q3989786) (← links)
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (Q4017520) (← links)
- (Q4028892) (← links)
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON (Q4294717) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- (Q5289053) (← links)
