NIST

straight-line drawing

(definition)

Definition: A graph drawing in which each edge is represented by a straight line segment.

See also grid drawing, orthogonal drawing, planar straight-line graph, Bresenham's algorithm.

Note: From Algorithms and Theory of Computation Handbook, page 9-23, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 14 March 2022.
HTML page formatted Mon Mar 14 09:45:02 2022.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "straight-line drawing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 14 March 2022. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/straightline.html