Tina M. Nicholl

According to our database, Tina M. Nicholl authored at least 6 papers between 1983 and 1992.

Collaborative distances:

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

1992

A Run-Length Slice Line Drawing Algorithm without Division Operations.

Khun Yee Fung, Tina M. Nicholl, A. K. Dewdney

Comput. Graph. Forum, 1992

1990

Performing geometric transformations by program transformation.

Robin A. Nicholl, Tina M. Nicholl

ACM Trans. Graph., 1990

Simplified Linear-Time Jordan Sorting and Polygon Clipping.

Khun Yee Fung, Tina M. Nicholl, Robert Endre Tarjan, Christopher J. Van Wyk

Inf. Process. Lett., 1990

The use of functional annotations in verifying imperative programs.

Robin A. Nicholl, Maurice Clint, David Gray, Tina M. Nicholl

Softw. Eng. J., 1990

1987

An efficient new algorithm for 2-D line clipping: Its development and analysis.

Tina M. Nicholl, D. T. Lee, Robin A. Nicholl

Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, 1987

1983

On the X-Y Convex Hull of a Set of X-Y Polygons.

Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong

BIT, 1983