It has a built-in two level table of contents linking book and chapter for easy navigation. It also includes the Epistle Dedicatory and the Translation to the Readers. If there are any errors in the content, please feel free to post a comment. I plan on continue working on this EPUB file in the future and I will post news on my website. I tested it on my Sony Reader and the Table of Contents may be accessed by choosing Option->Go To->Table of Contents. In the future, this will follow the title page.

Please don’t post comments complimenting me. I prefer to give all the Glory and Honor to the LORD JESUS CHRIST and I hope that you do too.

The Master would be the Mark 5.
Jack would be the Road King II.
And The Little Boogie That Can would be the Express 5:50.

Here’s my latest and greatest fuzz pedal. Betcha can’t find it anywhere!

ROBOT Win32 Binaries (115KB)
ROBOT Source (VC++ 2008) (8KB)

A is a linked list, B is a linked list

1. Split Intersecting Polygons
for Pa in A do
	for Pb in B do
		if (Pb has been intersected)
			continue
		if Pa intersects Pb do
			Split Pa against Pb and store as Pa_in and Pa_out
			Split Pb against Pa and store as Pb_in and Pb_out
			// Pa_in means Pa inside of B
			// Pa_out means Pa outside of B
			Mark Pa as "split"
			Mark Pb as "split"

			Add Pa_in to A
			Add Pa_out to A
			Add Pb_in to B
			Add Pb_out to B
		end
	end
end

2. Split into 4 sets: A_minus_B, B_minus_A, A_intersect_B, A_union_B
for Pa in A do
	If Pa has been intersected
		continue
	if Pa is inside of B
		Add -Pa to B_minus_A
		Add -Pa to A_intersect_B
	else
		Add Pa to A_minus_B
		Add Pa to A_union_B
	end
end

for Pb in B do
	If Pb has been intersected
		continue
	if Pb is inside of A
		Add -Pb to A_minus_B
		Add -Pb to A_intersect_B
	else
		Add Pb to B_minus_A
		Add Pb to A_union_B
	end
end