1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
|
<HTML>
<head><title>Implementation</title></head>
<BODY BGCOLOR=#FFFFFF>
<A NAME="topic1"></A><CENTER>
<A HREF="tree.htm"><img align=center src="contents.gif" BORDER=0 ALT="Contents"></A> <A HREF="tree.htm"><img align=center src="up.gif" BORDER=0 ALT="Up"></A> <A HREF="tree1.htm#topic0"><img align=center src="back.gif" BORDER=0 ALT="Previous"></A> <A HREF="tree3.htm#topic2"><img align=center src="forward.gif" BORDER=0 ALT="Next"></A> </CENTER><HR>
<H2>Implementation</H2>
<P>
The algorithm is due to Gabriel Robins [1], a linear-time
algorithm originally implemented in LISP for AI applications.<P>
The original algorithm has been modified so that both X and Y planes
are calculated simultaneously, increasing efficiency slightly. The basic
code is only a page or so long.<P>
</BODY></HTML>
|
