The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Cao An Wang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002