Cao An Wang

56 papers A* 1A 2B 6C 3Misc 7Journal 27Unranked 9
YearRankTypeTitle / Venue / Authors
2009 J jnl
Preface.
Theor. Comput. Sci.
Boting Yang, Cao An Wang
2008 C ed.
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings
COCOA
Boting Yang, Ding-Zhu Du, Cao An Wang
2007 — ch.
Approximation Algorithms for Some Optimal 2D and 3D Triangulations.
Handbook of Approximation Algorithms and Metaheuristics
Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang
2006 J jnl
Construction of the nearest neighbor embracing graph of a point set.
J. Comb. Optim.
Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang
2006 J jnl
How much precision is needed to compare two sums of square roots of integers?
Inf. Process. Lett.
Jianbo Qian, Cao An Wang
2006 J jnl
Progress on maximum weight triangulation.
Comput. Geom.
Jianbo Qian, Cao An Wang
2005 Misc conf
Randomly Generating Triangulations of a Simple Polygon.
COCOON
Qing-Huai Ding, J. Qian, Wai Wan Tsang, Cao An Wang
2004 J jnl
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons.
Algorithmica
Jianbo Qian, Cao An Wang
2004 — conf
Construction of the Nearest Neighbor Embracing Graph of a Point Set.
SWAT
Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang
2004 J jnl
Detecting tetrahedralizations of a set of line segments.
J. Algorithms
Boting Yang, Cao An Wang
2004 J jnl
Minimal Tetrahedralizations of a Class of Polyhedra.
J. Comb. Optim.
Boting Yang, Cao An Wang
2004 Misc conf
Progress on Maximum Weight Triangulation.
COCOON
Francis Y. L. Chin, Jianbo Qian, Cao An Wang
2003 — conf
A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.
CCCG
Ian Hsieh, Kiat-Choong Chen, Cao An Wang
2003 Misc conf
On Constrained Minimum Pseudotriangulations.
COCOON
Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu
2002 B conf
Algorithms and Complexity for Tetrahedralization Detections.
ISAAC
Boting Yang, Cao An Wang, Francis Y. L. Chin
2001 J jnl
A lower bound for beta-skeleton belonging to minimum weight triangulations.
Comput. Geom.
Cao An Wang, Boting Yang
2001 J jnl
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.
Discret. Comput. Geom.
Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang
2001 A* conf
Approximation for minimum triangulation of convex polyhedra.
SODA
Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang
2000 — conf
Minimal Tetrahedralizations of a Class of Polyhedra.
CCCG
Boting Yang, Cao An Wang
2000 J jnl
On Some Polyhedra Covering Problems.
J. Comb. Optim.
Cao An Wang, Bo-Ting Yang, Binhai Zhu
2000 C conf
Optimal Tetrahedralizations of Some Convex Polyhedra.
EuroCG
Cao An Wang, Boting Yang
2000 Misc conf
Tetrahedralization of Two Nested Convex Polyhedra.
COCOON
Cao An Wang, Bo-Ting Yang
2000 J jnl
Three-dimensional weak visibility: Complexity and applications.
Theor. Comput. Sci.
Cao An Wang, Binhai Zhu
2000 C conf
Triangulations without Minimum-Weight Drawing.
CIAC
Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang
2000 J jnl
Triangulations without minimum-weight drawing.
Inf. Process. Lett.
Cao An Wang, Francis Y. L. Chin, Boting Yang
1999 B conf
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.
WADS
Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang
1999 B conf
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.
WADS
Cao An Wang, Bo-Ting Yang
1999 J jnl
Computing a Minimum Weight Triangulation of a Sparse Point Set.
J. Glob. Optim.
Cao An Wang, Yin-Feng Xu
1999 J jnl
Finding the Medial Axis of a Simple Polygon in Linear Time.
Discret. Comput. Geom.
Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
1999 Misc conf
Maximum Stabbing Line in 2D Plane.
COCOON
Francis Y. L. Chin, Cao An Wang, Fu Lee Wang
1999 J jnl
Maximum Weight Triangulation and Graph Drawing.
Inf. Process. Lett.
Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang
1998 J jnl
Finding constrained and weighted Voronoi diagrams in the plane.
Comput. Geom.
Cao An Wang, Yung H. Tsin
1998 J jnl
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time.
SIAM J. Comput.
Francis Y. L. Chin, Cao An Wang
1998 A conf
Maximum Weight Triangulation and Graph Drawing.
GD
Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang
1998 Misc conf
Maximum Weight Triangulation and Its Application on Graph Drawing.
COCOON
Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang
1997 J jnl
A New Subgraph of Minimum Weight Triangulations.
J. Comb. Optim.
Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu
1997 — conf
Shooter location problems revisited.
CCCG
Cao An Wang, Binhai Zhu
1996 B conf
A New Subgraph of Minimum Weight Triangulations.
ISAAC
Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu
1996 J jnl
Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers.
Nord. J. Comput.
Yung H. Tsin, Cao An Wang
1996 — conf
On Stable Line Segments in Triangulations.
CCCG
Andranik Mirzaian, Cao An Wang, Yin-Feng Xu
1995 A conf
Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract).
ESA
Cao An Wang, Francis Y. L. Chin
1995 B conf
Finding the Medial Axis of a Simple Polygon in Linear Time.
ISAAC
Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
1995 Misc conf
Three Dimensional Weak Visibility: Complexity and Applications.
COCOON
Cao An Wang, Binhai Zhu
1994 — conf
An Optimal Algorithm for Greedy Triangulation of a Set of Points.
CCCG
Cao An Wang
1994 J jnl
Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane.
IEEE Trans. Pattern Anal. Mach. Intell.
Cao An Wang
1994 B conf
On Greedy Tetrahedralization of Points in 3D.
ISAAC
Francis Y. L. Chin, Cao An Wang
1993 J jnl
Duality of Constrained Voronoi Diagrams and Delaunay Triangulations.
Algorithmica
Barry Joe, Cao An Wang
1993 J jnl
Efficiently Updating Constrained Delaunay Triangulations.
BIT
Cao An Wang
1993 — conf
Tetrahedralization of Simple and Non-Simple Polyhedra.
CCCG
Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu
1991 J jnl
Finding Minimal Nested Polygons.
BIT
Cao An Wang
1987 J jnl
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane.
Inf. Process. Lett.
Cao An Wang, Yung H. Tsin
1987 — conf
An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments.
SCG
Cao An Wang, Lenhart K. Schubert
1986 — conf
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons.
SCG
Cao An Wang, Edward P. F. Chan
1985 J jnl
A unifying approach for a class of problems in the computational geometry of polygons.
Vis. Comput.
Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang
1984 J jnl
Minimum Vertex Distance Between Separable Convex Polygons.
Inf. Process. Lett.
Francis Y. L. Chin, Cao An Wang
1983 J jnl
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.
IEEE Trans. Computers
Francis Y. L. Chin, Cao An Wang