| 2006 |
|---|
| 23 | Construction of the nearest neighbor embracing graph of a point set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. J. Comb. Optim. (11): 435-443 (2006). Web SearchBibTeXDownload |
| 2004 |
|---|
| 22 | Progress on Maximum Weight Triangulation. Francis Y. L. Chin, Jianbo Qian, Cao An Wang. COCOON 2004, 53-61. Web SearchBibTeXDownload |
| 21 | Construction of the Nearest Neighbor Embracing Graph of a Point Set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. SWAT 2004, 150-160. Web SearchBibTeXDownload |
| 2002 |
|---|
| 20 | Algorithms and Complexity for Tetrahedralization Detections. Boting Yang, Cao An Wang, Francis Y. L. Chin. ISAAC 2002, 296-307. Web SearchBibTeXDownload |
| 2001 |
|---|
| 19 | Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang. Discrete & Computational Geometry (26): 499-511 (2001). Web SearchBibTeXDownload |
| 18 | Approximation for minimum triangulation of convex polyhedra. Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang. SODA 2001, 128-137. Web SearchBibTeXDownload |
| 2000 |
|---|
| 17 | Triangulations without Minimum-Weight Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. CIAC 2000, 163-173. Web SearchBibTeXDownload |
| 16 | Triangulations without minimum-weight drawing. Cao An Wang, Francis Y. L. Chin, Boting Yang. Inf. Process. Lett. (74): 183-189 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 15 | Maximum Stabbing Line in 2D Plane. Francis Y. L. Chin, Cao An Wang, Fu Lee Wang. COCOON 1999, 379-388. Web SearchBibTeXDownload |
| 14 | Finding the Medial Axis of a Simple Polygon in Linear Time. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang. Discrete & Computational Geometry (21): 405-420 (1999). Web SearchBibTeXDownload |
| 13 | Maximum Weight Triangulation and Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. Inf. Process. Lett. (70): 17-22 (1999). Web SearchBibTeXDownload |
| 12 | A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang. WADS 1999, 231-240. Web SearchBibTeXDownload |
| 1998 |
|---|
| 11 | Maximum Weight Triangulation and Its Application on Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. COCOON 1998, 25-34. Web SearchBibTeXDownload |
| 10 | Maximum Weight Triangulation and Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. Graph Drawing 1998, 460-461. Web SearchBibTeXDownload |
| 9 | Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. Francis Y. L. Chin, Cao An Wang. SIAM J. Comput. (28): 471-486 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 8 | A New Subgraph of Minimum Weight Triangulations. Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu. J. Comb. Optim. (1): 115-127 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 7 | A New Subgraph of Minimum Weight Triangulations. Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu. ISAAC 1996, 266-274. Web SearchBibTeXDownload |
| 1995 |
|---|
| 6 | Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract). Cao An Wang, Francis Y. L. Chin. ESA 1995, 280-294. Web SearchBibTeXDownload |
| 5 | Finding the Medial Axis of a Simple Polygon in Linear Time. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang. ISAAC 1995, 382-391. Web SearchBibTeXDownload |
| 1994 |
|---|
| 4 | On Greedy Tetrahedralization of Points in 3D. Francis Y. L. Chin, Cao An Wang. ISAAC 1994, 532-540. Web SearchBibTeXDownload |
| 1985 |
|---|
| 3 | A unifying approach for a class of problems in the computational geometry of polygons. Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang. The Visual Computer (1): 124-132 (1985). Web SearchBibTeXDownload |
| 1984 |
|---|
| 2 | Minimum Vertex Distance Between Separable Convex Polygons. Francis Y. L. Chin, Cao An Wang. Inf. Process. Lett. (18): 41-45 (1984). Web SearchBibTeXDownload |
| 1983 |
|---|
| 1 | Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons. Francis Y. L. Chin, Cao An Wang. IEEE Trans. Computers (32): 1203-1207 (1983). Web SearchBibTeXDownload |
