# Cao An Wang

According to our database

Collaborative distances:

^{1}, Cao An Wang authored at least 48 papers between 1983 and 2009.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2009

Theor. Comput. Sci., 2009

2007

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

2006

J. Comb. Optim., 2006

Inf. Process. Lett., 2006

Comput. Geom., 2006

2005

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

2004

J. Comb. Optim., 2004

J. Algorithms, 2004

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

Algorithmica, 2004

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

2003

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

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

2002

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

2001

Discret. Comput. Geom., 2001

Comput. Geom., 2001

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Theor. Comput. Sci., 2000

J. Comb. Optim., 2000

Inf. Process. Lett., 2000

Optimal Tetrahedralizations of Some Convex Polyhedra.

EuroCG, 2000

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

1999

J. Glob. Optim., 1999

Inf. Process. Lett., 1999

Discret. Comput. Geom., 1999

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.

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

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.

SIAM J. Comput., 1998

Comput. Geom., 1998

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

1997

J. Comb. Optim., 1997

Shooter location problems revisited.

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

1996

Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers.

Nord. J. Comput., 1996

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).

Proceedings of the Algorithms, 1995

1994

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

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

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

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

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

1993

BIT Comput. Sci. Sect., 1993

Algorithmica, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.

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

1991

BIT Comput. Sci. Sect., 1991

1987

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

Inf. Process. Lett., 1987

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

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

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

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.

Vis. Comput., 1985

1984

Inf. Process. Lett., 1984

1983

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

IEEE Trans. Computers, 1983