Cao An Wang

According to our database, Cao An Wang authored at least 48 papers between 1983 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Preface.

Boting Yang, Cao An Wang

Theor. Comput. Sci., 2009

2007

Approximation Algorithms for Some Optimal 2D and 3D Triangulations.

Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

2006

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., 2006

How much precision is needed to compare two sums of square roots of integers?

Jianbo Qian, Cao An Wang

Inf. Process. Lett., 2006

Progress on maximum weight triangulation.

Jianbo Qian, Cao An Wang

Comput. Geom., 2006

2005

Randomly Generating Triangulations of a Simple Polygon.

Qing-Huai Ding, J. Qian, Wai Wan Tsang, Cao An Wang

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Minimal Tetrahedralizations of a Class of Polyhedra.

Boting Yang, Cao An Wang

J. Comb. Optim., 2004

Detecting tetrahedralizations of a set of line segments.

Boting Yang, Cao An Wang

J. Algorithms, 2004

A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons.

Jianbo Qian, Cao An Wang

Algorithmica, 2004

Progress on Maximum Weight Triangulation.

Francis Y. L. Chin, Jianbo Qian, Cao An Wang

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On Constrained Minimum Pseudotriangulations.

Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.

Ian Hsieh, Kiat-Choong Chen, Cao An Wang

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Algorithms and Complexity for Tetrahedralization Detections.

Boting Yang, Cao An Wang, Francis Y. L. Chin

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.

Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang

Discret. Comput. Geom., 2001

A lower bound for beta-skeleton belonging to minimum weight triangulations.

Cao An Wang, Boting Yang

Comput. Geom., 2001

Approximation for minimum triangulation of convex polyhedra.

Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Three-dimensional weak visibility: Complexity and applications.

Cao An Wang, Binhai Zhu

Theor. Comput. Sci., 2000

On Some Polyhedra Covering Problems.

Cao An Wang, Bo-Ting Yang, Binhai Zhu

J. Comb. Optim., 2000

Triangulations without minimum-weight drawing.

Cao An Wang, Francis Y. L. Chin, Boting Yang

Inf. Process. Lett., 2000

Optimal Tetrahedralizations of Some Convex Polyhedra.

Cao An Wang, Boting Yang

EuroCG, 2000

Tetrahedralization of Two Nested Convex Polyhedra.

Cao An Wang, Bo-Ting Yang

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Computing a Minimum Weight Triangulation of a Sparse Point Set.

Cao An Wang, Yin-Feng Xu

J. Glob. Optim., 1999

Maximum Weight Triangulation and Graph Drawing.

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang

Inf. Process. Lett., 1999

Finding the Medial Axis of a Simple Polygon in Linear Time.

Francis Y. L. Chin, Jack Snoeyink, Cao An Wang

Discret. Comput. Geom., 1999

A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.

Cao An Wang, Bo-Ting Yang

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

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

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Maximum Stabbing Line in 2D Plane.

Francis Y. L. Chin, Cao An Wang, Fu Lee Wang

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

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., 1998

Finding constrained and weighted Voronoi diagrams in the plane.

Cao An Wang, Yung H. Tsin

Comput. Geom., 1998

Maximum Weight Triangulation and Its Application on Graph Drawing.

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

A New Subgraph of Minimum Weight Triangulations.

Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu

J. Comb. Optim., 1997

Shooter location problems revisited.

Cao An Wang, Binhai Zhu

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers.

Yung H. Tsin, Cao An Wang

Nord. J. Comput., 1996

On Stable Line Segments in Triangulations.

Andranik Mirzaian, Cao An Wang, Yin-Feng Xu

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

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

Proceedings of the Algorithms, 1995

1994

Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane.

Cao An Wang

IEEE Trans. Pattern Anal. Mach. Intell., 1994

On Greedy Tetrahedralization of Points in 3D.

Francis Y. L. Chin, Cao An Wang

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

An Optimal Algorithm for Greedy Triangulation of a Set of Points.

Cao An Wang

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Efficiently Updating Constrained Delaunay Triangulations.

Cao An Wang

BIT, 1993

Duality of Constrained Voronoi Diagrams and Delaunay Triangulations.

Barry Joe, Cao An Wang

Algorithmica, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.

Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1991

Finding Minimal Nested Polygons.

Cao An Wang

BIT, 1991

1987

An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane.

Cao An Wang, Yung H. Tsin

Inf. Process. Lett., 1987

An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments.

Cao An Wang, Lenhart K. Schubert

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons.

Cao An Wang, Edward P. F. Chan

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A unifying approach for a class of problems in the computational geometry of polygons.

Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang

Vis. Comput., 1985

1984

Minimum Vertex Distance Between Separable Convex Polygons.

Francis Y. L. Chin, Cao An Wang

Inf. Process. Lett., 1984

1983

Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.

Francis Y. L. Chin, Cao An Wang

IEEE Trans. Computers, 1983