summaryrefslogtreecommitdiffstats
path: root/libdimension/dimension
Commit message (Collapse)AuthorAgeFilesLines
* Fix parameter documentation for dmnsn_add_map_entry().Tavian Barnes2010-12-011-3/+3
|
* Make some empty parameter lists explicit.Tavian Barnes2010-11-302-3/+3
|
* Fix documentation for dmnsn_list_iterator_insert().Tavian Barnes2010-11-281-2/+2
|
* Fix constness for dmnsn_list_comparator_fn.Tavian Barnes2010-11-281-3/+8
|
* Implement pigment maps.Tavian Barnes2010-11-233-0/+36
|
* Generisise map implementation.Tavian Barnes2010-11-222-30/+80
|
* Rename dmnsn_*_init() to dmnsn_initialize_*().Tavian Barnes2010-11-225-13/+13
|
* Implement sky spheres.Tavian Barnes2010-11-193-0/+71
|
* Support global ambient_light.Tavian Barnes2010-11-191-0/+1
|
* Fix signed/unsigned comparison in DMNSN_ARRAY_FOREACH.Tavian Barnes2010-11-181-3/+3
|
* Make the bottom [0 0 0 1] of affine transformation matricies implicit.Tavian Barnes2010-11-161-15/+9
|
* End sentences with periods.Tavian Barnes2010-11-1514-78/+81
|
* Document libdimension with Doxygen.Tavian Barnes2010-11-1428-341/+1247
|
* Standard compliance.Tavian Barnes2010-11-102-2/+50
| | | | Apparently ssize_t isn't a standard type...
* Use Newton's method when the root bound is degenerate.Tavian Barnes2010-11-101-0/+12
|
* Add quick_color to pigments.Tavian Barnes2010-11-081-0/+3
|
* Add gradient pattern.Tavian Barnes2010-11-081-0/+1
|
* Fix double-init bug for inherited textures.Tavian Barnes2010-11-081-0/+1
|
* Optimize DMNSN_ARRAY_FOREACH_REVERSE() a bit.Tavian Barnes2010-11-081-3/+3
|
* Add dmnsn_orange color.Tavian Barnes2010-11-081-1/+1
|
* Support checkered pigments in dimension.Tavian Barnes2010-11-071-1/+7
|
* Add pattern framework, impelement checker pattern.Tavian Barnes2010-11-064-1/+101
|
* Add more in dmnsn_line_add_epsilon().Tavian Barnes2010-11-061-1/+1
|
* Factor out transformation code from object callbacks.Tavian Barnes2010-11-061-15/+5
|
* More numerical tweaks.Tavian Barnes2010-11-011-1/+1
|
* Be const-correct in polynomial.{c,h}.Tavian Barnes2010-10-301-3/+3
|
* Only return non-zero roots of polynomials.Tavian Barnes2010-10-291-2/+2
|
* Add torii to libdimension.Tavian Barnes2010-10-261-0/+3
|
* Add numerical polynomial solver based on Uspensky's algorithm.Tavian Barnes2010-10-262-0/+58
|
* Change initial array capacity to 2.Tavian Barnes2010-10-211-11/+11
| | | | | A quick experiment shows that arrays average less than 2 elements, and this helps a bit with the memory-hogginess of the parser.
* Add cone support to libdimension.Tavian Barnes2010-10-201-2/+2
|
* Missing `void' in argument list.Tavian Barnes2010-10-201-1/+1
|
* Inline some commonly-used functions.Tavian Barnes2010-10-182-3/+34
|
* Don't assume M_PI will be defined.Tavian Barnes2010-09-301-2/+2
|
* Make parts of the progress API internal.Tavian Barnes2010-09-291-13/+1
|
* Add a timer API to libdimension.Tavian Barnes2010-09-262-0/+38
|
* Add dmnsn_free() to match dmnsn_malloc().Tavian Barnes2010-09-263-4/+5
|
* Optimize DMNSN_ARRAY_FOREACH() a bit.Tavian Barnes2010-09-191-3/+3
|
* Support closed cylinders.Tavian Barnes2010-08-141-1/+3
|
* Add cylinders to libdimension.Tavian Barnes2010-08-141-0/+3
|
* Optimize PR-tree construction a bit.Tavian Barnes2010-08-011-0/+8
|
* Fix some -W{strict,missing}-prototypes warnings.Tavian Barnes2010-07-3111-18/+18
|
* Use dmnsn_min() and _max() in dmnsn_vector_min() and _max().Tavian Barnes2010-07-181-10/+10
|
* Don't expose the contents of struct dmnsn_progress.Tavian Barnes2010-07-141-23/+1
|
* New dmnsn_radians() and dmnsn_degrees() conversion functions.Tavian Barnes2010-07-031-1/+13
|
* Add some macros to make printf()-ing geometric types easier.Tavian Barnes2010-06-201-0/+18
|
* Bulk-load CSG unions.Tavian Barnes2010-06-141-1/+1
| | | | The old way made O(n) PR-trees for no particular reason.
* New dmnsn_bounding_box_is_infinite() predicate.Tavian Barnes2010-06-061-0/+7
|
* New bounding box special constructors.Tavian Barnes2010-06-061-0/+20
|
* Add children to dmnsn_objects, which enables splitting unions.Tavian Barnes2010-06-051-0/+3
| | | | Also, use PR-trees for unions internally.