This is the cl-voxelize Reference Manual, version 0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 05:31:49 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-voxelizeConvert polygon models into voxel models for particle-based physics simulation.
Masayuki Takagi
LLGPL
# cl-voxelize
[](https://travis-ci.org/takagi/cl-voxelize)
[](https://coveralls.io/r/takagi/cl-voxelize)
Cl-voxelize is a library to convert polygon models into voxel models for particle-based physics simulation.
## Example
Here shows an example of how to use cl-voxelize. With the Stanford bunny’s ply file, I illustrate how to load, voxelize and visualize it.
As an example data, use the Stanford bunny’s ply file from [the Stanford 3D Scanning Repository](https://graphics.stanford.edu/data/3Dscanrep/). Since the voxelization algorithm I adopt does not work well for polygon model with holes, I use Stanfords’s [Volfill](http://graphics.stanford.edu/software/volfill/) tool for hole filling. Additionally, I simplify the model with [QSlim](http://www.cs.cmu.edu/afs/cs/Web/People/garland/quadrics/qslim.html) for reducing voxelization time. This simplification make no effect on the result voxels in this case, because relatively coarse resolution is enough for particle-based simulation. A hole-filled and simplified Stanford bunny’s ply file is placed in this repository.
A hole-filled and simplified Stanford bunny in PLY format:
* https://github.com/takagi/cl-voxelize/blob/master/examples/bunny.ply
Read the Stanford bunny’s .ply file and convert it to a list of triangles which is input to ‘voxelize‘ function.
(defun triangles (vertices faces)
;; make a list of triangles from vertex array and face array
(let (ret)
(dotimes (i (array-dimension faces 0))
(let ((face (aref faces i)))
(let ((v0 (aref vertices (nth face 0)))
(v1 (aref vertices (nth face 1)))
(v2 (aref vertices (nth face 2))))
(push (list v0 v1 v2) ret))))
ret))
(defun ply-to-triangles (path)
(cl-ply:with-ply-for-reading (plyfile path)
(let ((vertices (make-array (cl-ply:ply-element-size plyfile "vertex")))
(faces (make-array (cl-ply:ply-element-size plyfile "face"))))
;; read vertices
(loop repeat (array-dimension vertices 0)
for i from 0
do (setf (aref vertices i)
(cl-ply:ply-read-element plyfile "vertex")))
;; read faces
(loop repeat (array-dimension faces 0)
for i from 0
do (setf (aref faces i)
(car (cl-ply:ply-read-element plyfile "face"))))
;; get triangles from vertices and faces
(triangles vertices faces))))
Voxelize the obtained triangles and get voxels as the result. The voxels are represented as a list of their center points.
(let ((triangles (ply-to-triangles "/path/to/bunny.ply"))
(delta 0.0045))
(voxelize triangles delta))
As an illustration, I show you the result voxels rendered with POV-Ray.
## Installation
You can install cl-voxelize via Quicklisp:
(ql:quickload :cl-voxelize)
## API
### [Function] voxelize
VOXELIZE triangles delta &optional antialias-p => voxels
Returns ‘voxels‘ with given ‘triangles‘ which is a list of triangles. ‘delta‘ is a floating point which specifies the resolution of voxels. ‘voxels‘ is represented as a list of voxels’ center points. If ‘antialias-p‘ is true, the result is antialiased.
### [Macro] do-voxelize
DO-VOXELIZE ((x y z) triangles delta &optional antialias-p) &body body => result
‘do-voxelize‘ is a ‘voxelize‘’s counterpart in ‘do-‘ style. Voxels’ center points are bound to ‘x‘, ‘y‘ and ‘z‘ symbols.
## FAQ
**Q. What are file formats to be voxelized?**
A. Any file formats are supported as far as they can be converted to fit cl-voxelize’s API interface.
**Q. How large polygon model? How long does it take to voxelize?**
A. Currently I do not set performance goal because relatively coarse resolution is enough for particle-based simulation.
**Q. Are there any restrictions for polygon models to be voxelized?**
A. The voxelization algorithm I adopt does not work well for polygon models with holes.
**Q. In a quadtree used in this implementation, how is a triangle which intersects with multiple sub-quadtrees treated?**
A. There are roughly two options how to treat a triangle which intersects with multiple sub-quadtrees:
* A triangle belongs to all sub-quadtrees with which it intersects
* A triangle belongs to only one of sub-quadtrees with which it intersects
To properly determine inside/outside in this case, I choose the former.
**Q. If a ray goes on a shared side of triangles through, is inside/outside rightly determined?**
A. To determine inside/outside in such case, duplicated intersections are removed.
**Q. What are tools used to make the Stanford bunny’s ply file in Example section?**
A. Tools I used were following:
* [ply2vri](http://grail.cs.washington.edu/software-data/ply2vri/) - a simple command line tool for converting triangle meshes in PLY format into signed-distance volumetric grids in VRI format
* [Volfill](http://graphics.stanford.edu/software/volfill/) - a program for filling in holes in dense polygon meshes using an algorithm based on volumetric diffusion
* [VRIP](http://graphics.stanford.edu/software/vrip/) - to convert a VRI file to a new triangle mesh in PLY format using the embedding implementation of Marching Cubes
* [QSlim](http://www.cs.cmu.edu/afs/cs/Web/People/garland/quadrics/qslim.html) - a program to simplify polygon model with QEM(Quadratic Error Metric)
* [Blender](http://www.blender.org/) - just for converting PLY format from/to OBJ format to apply QSlim
## Reference
* S. Thon, G. Gresquiere, and R. Raffin. "A low cost antialiased space filled voxelization of polygonal objects."
## Author
* Masayuki Takagi (kamonama@gmail.com)
## Copyright
Copyright (c) 2014 Masayuki Takagi (kamonama@gmail.com)
## License
Licensed under the LLGPL License.
0.1
alexandria (system).
src (module).
Modules are listed depth-first from the system components tree.
cl-voxelize/srccl-voxelize (system).
cl-voxelize.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-voxelize/cl-voxelize.asdcl-voxelize (system).
cl-voxelize/src/cl-voxelize.lispsrc (module).
do-voxelize (macro).
voxelize (function).
%%do-voxelize (function).
%%do-voxelize-antialias (function).
%do-voxelize (function).
%empty-quadtree (function).
%make-quadtree (function).
*inside-eps* (special variable).
*max-capacity* (special variable).
*max-depth* (special variable).
copy-quadtree (function).
devide-quadtree (function).
empty-quadtree (function).
insert-quadtree (function).
inside-p (function).
intersection-z (function).
intersections-z (function).
or! (function).
point-intersect-p (function).
quadtree (function).
quadtree (structure).
quadtree-boundary (reader).
(setf quadtree-boundary) (writer).
quadtree-depth (reader).
(setf quadtree-depth) (writer).
quadtree-leaf-p (function).
quadtree-max-capacity-p (function).
quadtree-max-depth-p (function).
quadtree-ne (reader).
(setf quadtree-ne) (writer).
quadtree-node-p (function).
quadtree-nw (reader).
(setf quadtree-nw) (writer).
quadtree-p (function).
quadtree-root-p (function).
quadtree-se (reader).
(setf quadtree-se) (writer).
quadtree-sw (reader).
(setf quadtree-sw) (writer).
quadtree-triangles (reader).
(setf quadtree-triangles) (writer).
query-quadtree (function).
triangle-bounding-box (function).
triangle-intersect-p (function).
triangles-bounding-box (function).
with-triangle (macro).
Packages are listed by definition order.
cl-voxelizecommon-lisp.
do-voxelize (macro).
voxelize (function).
%%do-voxelize (function).
%%do-voxelize-antialias (function).
%do-voxelize (function).
%empty-quadtree (function).
%make-quadtree (function).
*inside-eps* (special variable).
*max-capacity* (special variable).
*max-depth* (special variable).
copy-quadtree (function).
devide-quadtree (function).
empty-quadtree (function).
insert-quadtree (function).
inside-p (function).
intersection-z (function).
intersections-z (function).
or! (function).
point-intersect-p (function).
quadtree (function).
quadtree (structure).
quadtree-boundary (reader).
(setf quadtree-boundary) (writer).
quadtree-depth (reader).
(setf quadtree-depth) (writer).
quadtree-leaf-p (function).
quadtree-max-capacity-p (function).
quadtree-max-depth-p (function).
quadtree-ne (reader).
(setf quadtree-ne) (writer).
quadtree-node-p (function).
quadtree-nw (reader).
(setf quadtree-nw) (writer).
quadtree-p (function).
quadtree-root-p (function).
quadtree-se (reader).
(setf quadtree-se) (writer).
quadtree-sw (reader).
(setf quadtree-sw) (writer).
quadtree-triangles (reader).
(setf quadtree-triangles) (writer).
query-quadtree (function).
triangle-bounding-box (function).
triangle-intersect-p (function).
triangles-bounding-box (function).
with-triangle (macro).
Definitions are sorted by export status, category, package, and then by lexicographic order.
ne.
nw.
se.
sw.
| Jump to: | %
(
C D E F I M O P Q T V W |
|---|
| Jump to: | %
(
C D E F I M O P Q T V W |
|---|
| Jump to: | *
B D N S T |
|---|
| Jump to: | *
B D N S T |
|---|
| Jump to: | C F M P Q S |
|---|
| Jump to: | C F M P Q S |
|---|