This month, I added CSG (Constructive Solid Geometry) operators to the ray-tracer that I mentioned in the previous post. I added intersections, complements, and unions.
You can find the source code in my weekend-raytracer github repo.
This month, I added CSG (Constructive Solid Geometry) operators to the ray-tracer that I mentioned in the previous post. I added intersections, complements, and unions.
You can find the source code in my weekend-raytracer github repo.
Earlier this year, I started working through the online book Ray Tracing In One Weekend (Book 1). I have been following along with it in Common Lisp, and I have been extending it all from 3-dimensional to n-dimensional.
I reproduced 4-dimensional versions of all of the book images which you can see on my weekend-raytracer github page.
Here is the final image. This is a 250-samples-per-pixel, 640x360x10 image plane of three large hyperspheres (one mirrored, one diffuse, one glass) atop a very large, diffuse hypersphere. Also atop this very large hypersphere are a bunch of smaller hyperspheres of varying colors and materials. The image is rendered with some defocus-blur.
Caveat: This depends on a patched version of the policy-cond library that is not in the current Quicklisp distribution but should be in the next.
In doing a problem set from the Internet a few weeks ago, I found myself writing awkward constructions with REDUCE
and LOOP
to try to find the best one (or two or three) things in a big bag of things based on various criteria: similarity to English, hamming distance from their neighbor, etc.
I wrote a macro that encapsulated the pattern. I’ve reworked that macro into a library for public use.
There are a variety of examples in the README and the tests directory.
Here is one example to pique your interest. Suppose you have some data about the elevations of various cities in various states and you (being a Moxy Fruvous fan) want to know What Is the Lowest Highest Point?
Here’s how you might tackle that with the TRACK-BEST
library:
With this limited dataset, the end result would be (VALUES '("Alaska" "Fairbanks") 531)
. The inner WITH-TRACK-BEST
finds the highest city in each state. The outer WITH-TRACK-BEST
finds the lowest of these.
I am releasing a new version of the USerial library. New in this version:
I am releasing a new version of my USerial library. This version cleans up many messes from earlier releases. Unfortunately, in that process, it breaks compatibility with earlier releases.
Getting the USerial library:
The differences between this version and earlier versions of this library include:
:buffer
parameter in favor of using the *buffer*
special variable:buffer
parametermake-list-serializer
macroBy using ContextL layered functions, one has the ability to define a serializer and/or unserializer in a particular ContextL layer. This can be used to create new versions of the serializer without losing the ability to use the older version when required.
In the process, I have created macros to assist in creating completely custom serializers. This both streamlines their definition and should allow any future modifications to the USerial library to fly under the radar. Code that before looked like this:
Should now look like this:
And, when you find you need to add a new version of your :foo
serializer but you don’t want to lose the old one, you can add:
Without the :buffer
parameter everywhere, code that used to look like this:
Should now look like this:
There are now :int
and :uint
serializers that encode arbitrarily large integers and unsigned integers, respectively. There is also a serializer that copies a sequence of bytes as is without any prefix or suffix. To unserialize, you either have to provide a buffer of the appropriate length with the :output
parameter or provide appropriate :start
and :end
keywords.
And, if you have a serialize/unserialize pair for type :foo
you can use the make-list-serializer
macro to create a serialize/unserialize pair for a list of items that can be serialized with the :foo
serializer.
At the USerial home page, you can find more complete documentation.