Skip to main content
eScholarship
Open Access Publications from the University of California

Unit 32 - Simple Algorithms I - Intersection of Lines

Abstract

This unit reviews a few simple algorithms that are fundamental to the topics of later units, which describe how complex operations are constructed. It begins with a definition of algorithm and heuristic, then walks through an example of the steps required to assess whether two simple lines intersect. Special cases where this method fails are noted, and heuristics are presented for assessing whether complex lines intersect.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View