Cao An Wang

2008
51		Boting Yang, Ding-Zhu Du, Cao An Wang: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings Springer 2008
2006
50	EE	Jianbo Qian, Cao An Wang: Progress on maximum weight triangulation. Comput. Geom. 33(3): 99-105 (2006)
49	EE	Jianbo Qian, Cao An Wang: How much precision is needed to compare two sums of square roots of integers? Inf. Process. Lett. 100(5): 194-198 (2006)
48	EE	Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang: Construction of the nearest neighbor embracing graph of a point set. J. Comb. Optim. 11(4): 435-443 (2006)
2004
47	EE	Francis Y. L. Chin, Jianbo Qian, Cao An Wang: Progress on Maximum Weight Triangulation. COCOON 2004: 53-61
46	EE	Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang: Construction of the Nearest Neighbor Embracing Graph of a Point Set. SWAT 2004: 150-160
45	EE	Jianbo Qian, Cao An Wang: A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons. Algorithmica 40(3): 161-172 (2004)
44	EE	Boting Yang, Cao An Wang: Detecting tetrahedralizations of a set of line segments. J. Algorithms 53(1): 1-35 (2004)
43	EE	Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004)
2003
42		Ian Hsieh, Kiat-Choong Chen, Cao An Wang: A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron. CCCG 2003: 115-119
41	EE	Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu: On Constrained Minimum Pseudotriangulations. COCOON 2003: 445-454
2002
40	EE	Boting Yang, Cao An Wang, Francis Y. L. Chin: Algorithms and Complexity for Tetrahedralization Detections. ISAAC 2002: 296-307
2001
39	EE	Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang: Approximation for minimum triangulation of convex polyhedra. SODA 2001: 128-137
38		Cao An Wang, Boting Yang: A lower bound for beta-skeleton belonging to minimum weight triangulations. Comput. Geom. 19(1): 35-46 (2001)
37	EE	Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang: Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. Discrete & Computational Geometry 26(4): 499-511 (2001)
2000
36	EE	Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. CCCG 2000
35	EE	Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Triangulations without Minimum-Weight Drawing. CIAC 2000: 163-173
34	EE	Cao An Wang, Bo-Ting Yang: Tetrahedralization of Two Nested Convex Polyhedra. COCOON 2000: 291-298
33		Cao An Wang, Boting Yang: Optimal Tetrahedralizations of Some Convex Polyhedra. EWCG 2000: 5-9
32	EE	Cao An Wang, Francis Y. L. Chin, Boting Yang: Triangulations without minimum-weight drawing. Inf. Process. Lett. 74(5-6): 183-189 (2000)
31		Cao An Wang, Bo-Ting Yang, Binhai Zhu: On Some Polyhedra Covering Problems. J. Comb. Optim. 4(4): 437-447 (2000)
30	EE	Cao An Wang, Binhai Zhu: Three-dimensional weak visibility: Complexity and applications. Theor. Comput. Sci. 234(1-2): 219-232 (2000)
1999
29	EE	Francis Y. L. Chin, Cao An Wang, Fu Lee Wang: Maximum Stabbing Line in 2D Plane. COCOON 1999: 379-388
28	EE	Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang: A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. WADS 1999: 231-240
27	EE	Cao An Wang, Bo-Ting Yang: A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. WADS 1999: 265-275
26	EE	Francis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. Discrete & Computational Geometry 21(3): 405-420 (1999)
25	EE	Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Graph Drawing. Inf. Process. Lett. 70(1): 17-22 (1999)
1998
24	EE	Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Its Application on Graph Drawing. COCOON 1998: 25-34
23	EE	Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Graph Drawing. Graph Drawing 1998: 460-461
22		Cao An Wang, Yung H. Tsin: Finding constrained and weighted Voronoi diagrams in the plane. Comput. Geom. 10(2): 89-104 (1998)
21		Francis Y. L. Chin, Cao An Wang: Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. SIAM J. Comput. 28(2): 471-486 (1998)
1997
20		Cao An Wang, Binhai Zhu: Shooter location problems revisited. CCCG 1997
19		Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu: A New Subgraph of Minimum Weight Triangulations. J. Comb. Optim. 1(2): 115-127 (1997)
1996
18		Andranik Mirzaian, Cao An Wang, Yin-Feng Xu: On Stable Line Segments in Triangulations. CCCG 1996: 62-67
17		Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu: A New Subgraph of Minimum Weight Triangulations. ISAAC 1996: 266-274
16		Yung H. Tsin, Cao An Wang: Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. Nord. J. Comput. 3(1): 1-26 (1996)
1995
15		Cao An Wang, Binhai Zhu: Three Dimensional Weak Visibility: Complexity and Applications. COCOON 1995: 51-60
14		Cao An Wang, Francis Y. L. Chin: Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract). ESA 1995: 280-294
13		Francis Y. L. Chin, Jack Snoeyink, Cao An Wang: Finding the Medial Axis of a Simple Polygon in Linear Time. ISAAC 1995: 382-391
1994
12		Cao An Wang: An Optimal Algorithm for Greedy Triangulation of a Set of Points. CCCG 1994: 332-338
11		Francis Y. L. Chin, Cao An Wang: On Greedy Tetrahedralization of Points in 3D. ISAAC 1994: 532-540
10	EE	Cao An Wang: Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane. IEEE Trans. Pattern Anal. Mach. Intell. 16(6): 571-580 (1994)
1993
9		Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu: Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29
8		Barry Joe, Cao An Wang: Duality of Constrained Voronoi Diagrams and Delaunay Triangulations. Algorithmica 9(2): 142-155 (1993)
7		Cao An Wang: Efficiently Updating Constrained Delaunay Triangulations. BIT 33(2): 238-252 (1993)
1991
6		Cao An Wang: Finding Minimal Nested Polygons. BIT 31(2): 230-236 (1991)
1987
5	EE	Cao An Wang, Lenhart K. Schubert: An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. Symposium on Computational Geometry 1987: 223-232
4		Cao An Wang, Yung H. Tsin: An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. Inf. Process. Lett. 25(1): 55-60 (1987)
1985
3		Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang: A unifying approach for a class of problems in the computational geometry of polygons. The Visual Computer 1(2): 124-132 (1985)
1984
2		Francis Y. L. Chin, Cao An Wang: Minimum Vertex Distance Between Separable Convex Polygons. Inf. Process. Lett. 18(1): 41-45 (1984)
1983
1		Francis Y. L. Chin, Cao An Wang: Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons. IEEE Trans. Computers 32(12): 1203-1207 (1983)

Coauthor Index

1	Mee Yee Chan	[46] [48]
2	Danny Z. Chen	[46] [48]
3	Kiat-Choong Chen	[42]
4	Francis Y. L. Chin	[1] [2] [3] [11] [13] [14] [17] [19] [21] [23] [24] [25] [26] [28] [29] [32] [35] [37] [39] [40] [46] [47] [48]
5	Ding-Zhu Du	[51]
6	Stanley P. Y. Fung	[37] [39]
7	Ian Hsieh	[42]
8	Barry Joe	[8]
9	Der-Tsai Lee	[28]
10	Andranik Mirzaian (Andy Mirzaian)	[18]
11	Jianbo Qian	[45] [47] [49] [50]
12	Günter Rote	[41]
13	Jeffrey Sampson	[3]
14	Lenhart K. Schubert	[5]
15	Jack Snoeyink	[13] [26]
16	Godfried T. Toussaint	[9]
17	Yung H. Tsin	[4] [16] [22]
18	Clark Verbrugge	[9]
19	Fu Lee Wang	[29]
20	Lusheng Wang	[41]
21	Yin-Feng Xu	[17] [18] [19] [41]
22	Boting Yang (Bo-Ting Yang)	[23] [24] [25] [27] [31] [32] [33] [34] [35] [36] [38] [40] [43] [44] [51]
23	Binhai Zhu	[9] [15] [20] [30] [31]

Colors in the list of coauthors