default search action
Cao An Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j27]Boting Yang, Cao An Wang:
Preface. Theor. Comput. Sci. 410(52): 5383 (2009) - 2008
- [e1]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. Lecture Notes in Computer Science 5165, Springer 2008, ISBN 978-3-540-85096-0 [contents] - 2007
- [r1]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation Algorithms for Some Optimal 2D and 3D Triangulations. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j26]Jianbo Qian, Cao An Wang:
Progress on maximum weight triangulation. Comput. Geom. 33(3): 99-105 (2006) - [j25]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) - [j24]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) - 2005
- [c26]Qing-Huai Ding, J. Qian, Wai Wan Tsang, Cao An Wang:
Randomly Generating Triangulations of a Simple Polygon. COCOON 2005: 471-480 - 2004
- [j23]Jianbo Qian, Cao An Wang:
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons. Algorithmica 40(3): 161-172 (2004) - [j22]Boting Yang, Cao An Wang:
Detecting tetrahedralizations of a set of line segments. J. Algorithms 53(1): 1-35 (2004) - [j21]Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004) - [c25]Francis Y. L. Chin, Jianbo Qian, Cao An Wang:
Progress on Maximum Weight Triangulation. COCOON 2004: 53-61 - [c24]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 - 2003
- [c23]Ian Hsieh, Kiat-Choong Chen, Cao An Wang:
A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron. CCCG 2003: 115-119 - [c22]Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu:
On Constrained Minimum Pseudotriangulations. COCOON 2003: 445-454 - 2002
- [c21]Boting Yang, Cao An Wang, Francis Y. L. Chin:
Algorithms and Complexity for Tetrahedralization Detections. ISAAC 2002: 296-307 - 2001
- [j20]Cao An Wang, Boting Yang:
A lower bound for beta-skeleton belonging to minimum weight triangulations. Comput. Geom. 19(1): 35-46 (2001) - [j19]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. Discret. Comput. Geom. 26(4): 499-511 (2001) - [c20]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for minimum triangulation of convex polyhedra. SODA 2001: 128-137 - 2000
- [j18]Cao An Wang, Francis Y. L. Chin, Boting Yang:
Triangulations without minimum-weight drawing. Inf. Process. Lett. 74(5-6): 183-189 (2000) - [j17]Cao An Wang, Bo-Ting Yang, Binhai Zhu:
On Some Polyhedra Covering Problems. J. Comb. Optim. 4(4): 437-447 (2000) - [j16]Cao An Wang, Binhai Zhu:
Three-dimensional weak visibility: Complexity and applications. Theor. Comput. Sci. 234(1-2): 219-232 (2000) - [c19]Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. CCCG 2000 - [c18]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Triangulations without Minimum-Weight Drawing. CIAC 2000: 163-173 - [c17]Cao An Wang, Bo-Ting Yang:
Tetrahedralization of Two Nested Convex Polyhedra. COCOON 2000: 291-298 - [i1]Cao An Wang, Boting Yang:
Optimal Tetrahedralizations of Some Convex Polyhedra. EuroCG 2000: 5-9
1990 – 1999
- 1999
- [j15]Francis Y. L. Chin, Jack Snoeyink, Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time. Discret. Comput. Geom. 21(3): 405-420 (1999) - [j14]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing. Inf. Process. Lett. 70(1): 17-22 (1999) - [j13]Cao An Wang, Yin-Feng Xu:
Computing a Minimum Weight Triangulation of a Sparse Point Set. J. Glob. Optim. 15(1): 73-83 (1999) - [c16]Francis Y. L. Chin, Cao An Wang, Fu Lee Wang
:
Maximum Stabbing Line in 2D Plane. COCOON 1999: 379-388 - [c15]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 - [c14]Cao An Wang, Bo-Ting Yang:
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. WADS 1999: 265-275 - 1998
- [j12]Cao An Wang, Yung H. Tsin:
Finding constrained and weighted Voronoi diagrams in the plane. Comput. Geom. 10(2): 89-104 (1998) - [j11]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) - [c13]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Its Application on Graph Drawing. COCOON 1998: 25-34 - [c12]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing. GD 1998: 460-461 - 1997
- [j10]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) - [c11]Cao An Wang, Binhai Zhu:
Shooter location problems revisited. CCCG 1997 - 1996
- [j9]Yung H. Tsin, Cao An Wang:
Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. Nord. J. Comput. 3(1): 1-26 (1996) - [c10]Andranik Mirzaian, Cao An Wang, Yin-Feng Xu:
On Stable Line Segments in Triangulations. CCCG 1996: 62-67 - [c9]Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu:
A New Subgraph of Minimum Weight Triangulations. ISAAC 1996: 266-274 - 1995
- [c8]Cao An Wang, Binhai Zhu:
Three Dimensional Weak Visibility: Complexity and Applications. COCOON 1995: 51-60 - [c7]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 - [c6]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
- [j8]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) - [c5]Cao An Wang:
An Optimal Algorithm for Greedy Triangulation of a Set of Points. CCCG 1994: 332-338 - [c4]Francis Y. L. Chin, Cao An Wang:
On Greedy Tetrahedralization of Points in 3D. ISAAC 1994: 532-540 - 1993
- [j7]Barry Joe, Cao An Wang:
Duality of Constrained Voronoi Diagrams and Delaunay Triangulations. Algorithmica 9(2): 142-155 (1993) - [j6]Cao An Wang:
Efficiently Updating Constrained Delaunay Triangulations. BIT 33(2): 238-252 (1993) - [c3]Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29 - 1991
- [j5]Cao An Wang:
Finding Minimal Nested Polygons. BIT 31(2): 230-236 (1991)
1980 – 1989
- 1987
- [j4]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) - [c2]Cao An Wang, Lenhart K. Schubert:
An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. SCG 1987: 223-232 - 1986
- [c1]Cao An Wang, Edward P. F. Chan:
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. SCG 1986: 34-42 - 1985
- [j3]Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang:
A unifying approach for a class of problems in the computational geometry of polygons. Vis. Comput. 1(2): 124-132 (1985) - 1984
- [j2]Francis Y. L. Chin, Cao An Wang:
Minimum Vertex Distance Between Separable Convex Polygons. Inf. Process. Lett. 18(1): 41-45 (1984) - 1983
- [j1]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
aka: Bo-Ting Yang
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: