Tony C. Woo

According to our database1, Tony C. Woo authored at least 26 papers between 1975 and 2006.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
Algebraic and geometric approximation of waves among obstacles.
Comput. Aided Des., 2006

2004
Manufacturing processes.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Geometry of inhibition and activation in kinematic waves.
Comput. Aided Des., 2004

2003
Mass customization: 2-D projection of high dimensional data.
IEEE Trans. Syst. Man Cybern. Part A, 2003

2001
A linear-time, constant-space algorithm for computing the spanning line segments in three dimensions.
Comput. Aided Des., 2001

1998
Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing.
Comput. Aided Des., 1998

1997
Computing planar swept polygons under translation.
Comput. Aided Des., 1997

1996
Computing spanning line segments in three dimensions.
Vis. Comput., 1996

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining.
Comput. Aided Des., 1996

1995
Tangent, normal, and visibility cones on Bézier surfaces.
Comput. Aided Geom. Des., 1995

1994
Visibility maps and spherical algorithms.
Comput. Aided Des., 1994

Scallop hull and its offset.
Comput. Aided Des., 1994

1993
Separating and Intersecting Spherical Polygons: Computing Machinability on Three-, Four-, and Five-axis Numerically Controlled Machines.
ACM Trans. Graph., 1993

On the Number of Guard Edges of a Polygon.
Discret. Comput. Geom., 1993

Dimensional measurement of surfaces and their sampling.
Comput. Aided Des., 1993

Special issue: Uncertainties in geometric design.
Comput. Aided Des., 1993

Parting directions for mould and die design.
Comput. Aided Des., 1993

1989
An optimal algorithm for finding all visible edges in a simple polygon.
IEEE Trans. Robotics Autom., 1989

1986
Finding the convex hull of a simple polygon in linear time.
Pattern Recognit., 1986

1985
Optimal algorithms for symmetry detection in two and three dimensions.
Vis. Comput., 1985

A Linear Time Algorithm for Triangulating a Point-Visible Polygon.
ACM Trans. Graph., 1985

A Combinatorial Analysis of Boundary Data Structure Schemata.
IEEE Computer Graphics and Applications, 1985

1984
A constant expected time, linear storage data structure for representing three-dimensional objects.
IEEE Trans. Syst. Man Cybern., 1984

Interfacing Solid Modeling to CAD and CAM: Data Structures and Algorithms for Decomposing a Solid.
Computer, 1984

1977
Progress in Shape Modeling.
Computer, 1977

1975
Automatic program synthesis: from CAD to CAM.
Proceedings of the American Federation of Information Processing Societies: 1975 National Computer Conference, 1975


  Loading...