├── .gitignore ├── LICENSE.md ├── Makefile ├── README.md └── src ├── base.cpp ├── base.h ├── blur.cpp ├── blur.h ├── cmdline.h ├── heightmap.cpp ├── heightmap.h ├── main.cpp ├── stb_image.h ├── stb_image_write.h ├── stl.cpp ├── stl.h ├── triangulator.cpp └── triangulator.h /.gitignore: -------------------------------------------------------------------------------- 1 | /bin 2 | /build 3 | /hmm 4 | 5 | -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | Copyright (C) 2019 Michael Fogleman 2 | 3 | Permission is hereby granted, free of charge, to any person obtaining a copy 4 | of this software and associated documentation files (the "Software"), to deal 5 | in the Software without restriction, including without limitation the rights 6 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 7 | copies of the Software, and to permit persons to whom the Software is 8 | furnished to do so, subject to the following conditions: 9 | 10 | The above copyright notice and this permission notice shall be included in all 11 | copies or substantial portions of the Software. 12 | 13 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 14 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 15 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 16 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 17 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 18 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 19 | SOFTWARE. 20 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | #### PROJECT SETTINGS #### 2 | # The name of the executable to be created 3 | BIN_NAME := hmm 4 | # Compiler used 5 | C ?= g++ 6 | # Extension of source files used in the project 7 | SRC_EXT = cpp 8 | # Path to the source directory, relative to the makefile 9 | SRC_PATH = src 10 | # General compiler flags 11 | COMPILE_FLAGS = -std=c++11 -flto -O3 -Wall -Wextra -Wno-sign-compare -march=native 12 | # Additional release-specific flags 13 | RCOMPILE_FLAGS = -D NDEBUG 14 | # Additional debug-specific flags 15 | DCOMPILE_FLAGS = -D DEBUG 16 | # Add additional include paths 17 | INCLUDES = -I $(SRC_PATH) 18 | # General linker settings 19 | LINK_FLAGS = -flto -O3 20 | # Additional release-specific linker settings 21 | RLINK_FLAGS = 22 | # Additional debug-specific linker settings 23 | DLINK_FLAGS = 24 | # Destination directory, like a jail or mounted system 25 | DESTDIR = / 26 | # Install path (bin/ is appended automatically) 27 | INSTALL_PREFIX = usr/local 28 | #### END PROJECT SETTINGS #### 29 | 30 | # Generally should not need to edit below this line 31 | 32 | # Shell used in this makefile 33 | # bash is used for 'echo -en' 34 | SHELL = /bin/bash 35 | # Clear built-in rules 36 | .SUFFIXES: 37 | # Programs for installation 38 | INSTALL = install 39 | INSTALL_PROGRAM = $(INSTALL) 40 | INSTALL_DATA = $(INSTALL) -m 644 41 | 42 | # Verbose option, to output compile and link commands 43 | export V := false 44 | export CMD_PREFIX := @ 45 | ifeq ($(V),true) 46 | CMD_PREFIX := 47 | endif 48 | 49 | # Combine compiler and linker flags 50 | release: export CFLAGS := $(CFLAGS) $(COMPILE_FLAGS) $(RCOMPILE_FLAGS) 51 | release: export LDFLAGS := $(LDFLAGS) $(LINK_FLAGS) $(RLINK_FLAGS) 52 | debug: export CFLAGS := $(CFLAGS) $(COMPILE_FLAGS) $(DCOMPILE_FLAGS) 53 | debug: export LDFLAGS := $(LDFLAGS) $(LINK_FLAGS) $(DLINK_FLAGS) 54 | 55 | # Build and output paths 56 | release: export BUILD_PATH := build/release 57 | release: export BIN_PATH := bin/release 58 | debug: export BUILD_PATH := build/debug 59 | debug: export BIN_PATH := bin/debug 60 | install: export BIN_PATH := bin/release 61 | 62 | # Find all source files in the source directory, sorted by most 63 | # recently modified 64 | SOURCES = $(shell find $(SRC_PATH)/ -name '*.$(SRC_EXT)' \ 65 | | sort -k 1nr | cut -f2-) 66 | # fallback in case the above fails 67 | rwildcard = $(foreach d, $(wildcard $1*), $(call rwildcard,$d/,$2) \ 68 | $(filter $(subst *,%,$2), $d)) 69 | ifeq ($(SOURCES),) 70 | SOURCES := $(call rwildcard, $(SRC_PATH)/, *.$(SRC_EXT)) 71 | endif 72 | 73 | # Set the object file names, with the source directory stripped 74 | # from the path, and the build path prepended in its place 75 | OBJECTS = $(SOURCES:$(SRC_PATH)/%.$(SRC_EXT)=$(BUILD_PATH)/%.o) 76 | # Set the dependency files that will be used to add header dependencies 77 | DEPS = $(OBJECTS:.o=.d) 78 | 79 | # Macros for timing compilation 80 | TIME_FILE = $(dir $@).$(notdir $@)_time 81 | START_TIME = date '+%s' > $(TIME_FILE) 82 | END_TIME = read st < $(TIME_FILE) ; \ 83 | $(RM) $(TIME_FILE) ; \ 84 | st=$$((`date '+%s'` - $$st - 86400)) ; \ 85 | echo `date -u -d @$$st '+%H:%M:%S'` 86 | 87 | # Version macros 88 | # Comment/remove this section to remove versioning 89 | USE_VERSION := false 90 | # If this isn't a git repo or the repo has no tags, git describe will return non-zero 91 | ifeq ($(shell git describe > /dev/null 2>&1 ; echo $$?), 0) 92 | USE_VERSION := true 93 | VERSION := $(shell git describe --tags --long --dirty --always | \ 94 | sed 's/v\([0-9]*\)\.\([0-9]*\)\.\([0-9]*\)-\?.*-\([0-9]*\)-\(.*\)/\1 \2 \3 \4 \5/g') 95 | VERSION_MAJOR := $(word 1, $(VERSION)) 96 | VERSION_MINOR := $(word 2, $(VERSION)) 97 | VERSION_PATCH := $(word 3, $(VERSION)) 98 | VERSION_REVISION := $(word 4, $(VERSION)) 99 | VERSION_HASH := $(word 5, $(VERSION)) 100 | VERSION_STRING := \ 101 | "$(VERSION_MAJOR).$(VERSION_MINOR).$(VERSION_PATCH).$(VERSION_REVISION)-$(VERSION_HASH)" 102 | override CFLAGS := $(CFLAGS) \ 103 | -D VERSION_MAJOR=$(VERSION_MAJOR) \ 104 | -D VERSION_MINOR=$(VERSION_MINOR) \ 105 | -D VERSION_PATCH=$(VERSION_PATCH) \ 106 | -D VERSION_REVISION=$(VERSION_REVISION) \ 107 | -D VERSION_HASH=\"$(VERSION_HASH)\" 108 | endif 109 | 110 | # Standard, non-optimized release build 111 | .PHONY: release 112 | release: dirs 113 | ifeq ($(USE_VERSION), true) 114 | @echo "Beginning release build v$(VERSION_STRING)" 115 | else 116 | @echo "Beginning release build" 117 | endif 118 | @$(MAKE) all --no-print-directory 119 | 120 | # Debug build for gdb debugging 121 | .PHONY: debug 122 | debug: dirs 123 | ifeq ($(USE_VERSION), true) 124 | @echo "Beginning debug build v$(VERSION_STRING)" 125 | else 126 | @echo "Beginning debug build" 127 | endif 128 | @$(MAKE) all --no-print-directory 129 | 130 | # Create the directories used in the build 131 | .PHONY: dirs 132 | dirs: 133 | @echo "Creating directories" 134 | @mkdir -p $(dir $(OBJECTS)) 135 | @mkdir -p $(BIN_PATH) 136 | 137 | # Installs to the set path 138 | .PHONY: install 139 | install: 140 | @echo "Installing to $(DESTDIR)$(INSTALL_PREFIX)/bin" 141 | @$(INSTALL_PROGRAM) $(BIN_PATH)/$(BIN_NAME) $(DESTDIR)$(INSTALL_PREFIX)/bin 142 | 143 | # Uninstalls the program 144 | .PHONY: uninstall 145 | uninstall: 146 | @echo "Removing $(DESTDIR)$(INSTALL_PREFIX)/bin/$(BIN_NAME)" 147 | @$(RM) $(DESTDIR)$(INSTALL_PREFIX)/bin/$(BIN_NAME) 148 | 149 | # Removes all build files 150 | .PHONY: clean 151 | clean: 152 | @echo "Deleting $(BIN_NAME) symlink" 153 | @$(RM) $(BIN_NAME) 154 | @echo "Deleting directories" 155 | @$(RM) -r build 156 | @$(RM) -r bin 157 | 158 | # Main rule, checks the executable and symlinks to the output 159 | all: $(BIN_PATH)/$(BIN_NAME) 160 | @echo "Making symlink: $(BIN_NAME) -> $<" 161 | @$(RM) $(BIN_NAME) 162 | @ln -s $(BIN_PATH)/$(BIN_NAME) $(BIN_NAME) 163 | 164 | # Link the executable 165 | $(BIN_PATH)/$(BIN_NAME): $(OBJECTS) 166 | @echo "Linking: $@" 167 | $(CMD_PREFIX)$(C) $(OBJECTS) $(LDFLAGS) -o $@ 168 | 169 | # Add dependency files, if they exist 170 | -include $(DEPS) 171 | 172 | # Source file rules 173 | # After the first compilation they will be joined with the rules from the 174 | # dependency files to provide header dependencies 175 | $(BUILD_PATH)/%.o: $(SRC_PATH)/%.$(SRC_EXT) 176 | @echo "Compiling: $< -> $@" 177 | $(CMD_PREFIX)$(C) $(CFLAGS) $(INCLUDES) -MP -MMD -c $< -o $@ 178 | 179 | .PHONY: run 180 | run: release 181 | time ./$(BIN_NAME) 182 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # hmm 2 | 3 | `hmm` is a heightmap meshing utility. 4 | 5 | If you've done any 3D game development, 3D printing, or other such things, 6 | you've likely wanted to convert a grayscale heightmap image into a 3D mesh. The 7 | naive way is pretty simple but generates huge meshes with millions of 8 | triangles. After hacking my way through various solutions over the years, I 9 | finally decided I needed to write a good tool for this purpose. 10 | 11 | `hmm` is a modern implementation of a nice algorithm from the 1995 paper 12 | [Fast Polygonal Approximation of Terrains and Height Fields](http://mgarland.org/files/papers/scape.pdf) 13 | by Garland and Heckbert. The meshes produced by `hmm` satisfy the Delaunay 14 | condition and can satisfy a specified maximal error or maximal number of 15 | triangles or vertices. It's also very fast. 16 | 17 | ![Example](https://i.imgur.com/xLGcmWS.png) 18 | 19 | ### Dependencies 20 | 21 | - C++11 or higher 22 | - [glm](https://glm.g-truc.net/0.9.9/index.html) 23 | 24 | ### Installation 25 | 26 | ```bash 27 | brew install glm # on macOS 28 | sudo apt-get install libglm-dev # on Ubuntu / Debian 29 | 30 | git clone https://github.com/fogleman/hmm.git 31 | cd hmm 32 | make 33 | make install 34 | ``` 35 | 36 | ### Usage 37 | 38 | ``` 39 | heightmap meshing utility 40 | usage: hmm --zscale=float [options] ... infile outfile.stl 41 | options: 42 | -z, --zscale z scale relative to x & y (float) 43 | -x, --zexagg z exaggeration (float [=1]) 44 | -e, --error maximum triangulation error (float [=0.001]) 45 | -t, --triangles maximum number of triangles (int [=0]) 46 | -p, --points maximum number of vertices (int [=0]) 47 | -b, --base solid base height (float [=0]) 48 | --level auto level input to full grayscale range 49 | --invert invert heightmap 50 | --blur gaussian blur sigma (int [=0]) 51 | --gamma gamma curve exponent (float [=0]) 52 | --border-size border size in pixels (int [=0]) 53 | --border-height border z height (float [=1]) 54 | --normal-map path to write normal map png (string [=]) 55 | --shade-path path to write hillshade png (string [=]) 56 | --shade-alt hillshade light altitude (float [=45]) 57 | --shade-az hillshade light azimuth (float [=0]) 58 | -q, --quiet suppress console output 59 | -?, --help print this message 60 | ``` 61 | 62 | `hmm` supports a variety of file formats like PNG, JPG, etc. for the input 63 | heightmap. The output is always a binary STL file. The only other required 64 | parameter is `-z`, which specifies how much to scale the Z axis in the output 65 | mesh. 66 | 67 | ```bash 68 | $ hmm input.png output.stl -z ZSCALE 69 | ``` 70 | 71 | You can also provide a maximal allowed error, number of triangles, or number of 72 | vertices. (If multiple are specified, the first one reached is used.) 73 | 74 | ```bash 75 | $ hmm input.png output.stl -z 100 -e 0.001 -t 1000000 76 | ``` 77 | 78 | ### Visual Guide 79 | 80 | Click on the image below to see examples of various command line arguments. You 81 | can try these examples yourself with this heightmap: [gale.png](https://www.michaelfogleman.com/static/hmm/guide/gale.png). 82 | 83 | ![Visual Guide](https://www.michaelfogleman.com/static/hmm/guide/all.png) 84 | 85 | ### Z Scale 86 | 87 | The required `-z` parameter defines the distance between a fully black pixel 88 | and a fully white pixel in the vertical Z axis, with units equal to one pixel 89 | width or height. For example, if each pixel in the heightmap represented a 1x1 90 | meter square area, and the vertical range of the heightmap was 100 meters, then 91 | `-z 100` should be used. 92 | 93 | ### Z Exaggeration 94 | 95 | The `-x` parameter is simply an extra multiplier on top of the provided Z 96 | scale. It is provided as a convenience so you don't have to do multiplication 97 | in your head just to exaggerate by, e.g. 2x, since Z scales are often derived 98 | from real world data and can have strange values like 142.2378. 99 | 100 | ### Max Error 101 | 102 | The `-e` parameter defines the maximum allowed error in the output mesh, as a 103 | percentage of the total mesh height. For example, if `-e 0.01` is used, then no 104 | pixel will have an error of more than 1% of the distance between a fully black 105 | pixel and a fully white pixel. This means that for an 8-bit input image, an 106 | error of `e = 1 / 256 ~= 0.0039` will ensure that no pixel has an error greater 107 | than one full grayscale unit. (It may still be desirable to use a lower value 108 | like `0.5 / 256`.) 109 | 110 | ### Base Height 111 | 112 | When the `-b` option is used to create a solid mesh, it defines the height of 113 | the base before the lowest part of the heightmesh appears, as a percentage of 114 | the heightmap's height. For example, if `-z 100 -b 0.5` were used, then the 115 | final mesh would be about 150 units tall (if a fully white pixel exists in the 116 | input). 117 | 118 | ### Border 119 | 120 | A border can be added to the mesh with the `--border-size` and 121 | `--border-height` flags. The heightmap will be padded by `border-size` pixels 122 | before triangulating. The (pre-scaled) Z value of the border can be set with 123 | `border-height` which defaults to 1. 124 | 125 | ### Filters 126 | 127 | A Gaussian blur can be applied with the `--blur` flag. This is particularly 128 | useful for noisy images. 129 | 130 | The heightmap can be inverted with the `--invert` flag. This is useful for 131 | [lithophanes](https://en.wikipedia.org/wiki/Lithophane). 132 | 133 | The heightmap can be auto-leveled with the `--level` flag. This will stretch 134 | the grayscale values to use the entire black => white range. 135 | 136 | A gamma curve can be applied to the heightmap with the `--gamma` flag. This 137 | applies `x = x ^ gamma` to each pixel, where `x` is in [0, 1]. 138 | 139 | ### Normal Maps 140 | 141 | A full resolution [normal map](https://en.wikipedia.org/wiki/Normal_mapping) 142 | can be generated with the `--normal-map` argument. This will save a normal map 143 | as an RGB PNG to the specified path. This is useful for rendering higher 144 | resolution bumps and details while using a lower resolution triangle mesh. 145 | 146 | ### Hillshade Images 147 | 148 | A grayscale hillshade image can be generated with the `--shade-path` argument. 149 | The altitude and azimuth of the light source can be changed with the 150 | `--shade-alt` and `--shade-az` arguments, which default to 45 degrees in 151 | altitude and 0 degrees from north (up). 152 | 153 | ### Performance 154 | 155 | Performance depends a lot on the amount of detail in the heightmap, but here 156 | are some figures for an example heightmap of a [40x40 kilometer area centered 157 | on Mount Everest](https://i.imgur.com/1i9djJ0.jpg). Various heightmap 158 | resolutions and permitted max errors are shown. Times computed on a 2018 13" 159 | MacBook Pro (2.7 GHz Intel Core i7). 160 | 161 | #### Runtime in Seconds 162 | 163 | | Image Size / Error | e=0.01 | e=0.001 | e=0.0005 | e=0.0001 | 164 | | ---: | ---: | ---: | ---: | ---: | 165 | | 9490 x 9490 px (90.0 MP) | 6.535 | 13.102 | 19.394 | 58.949 | 166 | | 4745 x 4745 px (22.5 MP) | 1.867 | 4.903 | 8.886 | 33.327 | 167 | | 2373 x 2373 px (5.6 MP) | 0.559 | 2.353 | 4.930 | 14.243 | 168 | | 1187 x 1187 px (1.4 MP) | 0.168 | 1.021 | 1.961 | 3.709 | 169 | 170 | #### Number of Triangles Output 171 | 172 | | Image Size / Error | e=0.01 | e=0.001 | e=0.0005 | e=0.0001 | 173 | | ---: | ---: | ---: | ---: | ---: | 174 | | 9490 x 9490 px (90.0 MP) | 33,869 | 1,084,972 | 2,467,831 | 14,488,022 | 175 | | 4745 x 4745 px (22.5 MP) | 33,148 | 1,032,263 | 2,323,772 | 11,719,491 | 176 | | 2373 x 2373 px (5.6 MP) | 31,724 | 935,787 | 1,979,227 | 6,561,070 | 177 | | 1187 x 1187 px (1.4 MP) | 27,275 | 629,352 | 1,160,079 | 2,347,713 | 178 | 179 | ### TODO 180 | 181 | - reconstruct grayscale image? 182 | - better error handling, especially for file I/O 183 | - better overflow handling - what's the largest supported heightmap? 184 | - mesh validation? 185 | -------------------------------------------------------------------------------- /src/base.cpp: -------------------------------------------------------------------------------- 1 | #include "base.h" 2 | 3 | #define GLM_ENABLE_EXPERIMENTAL 4 | 5 | #include 6 | #include 7 | #include 8 | 9 | void AddBase( 10 | std::vector &points, 11 | std::vector &triangles, 12 | const int w, const int h, const float z) 13 | { 14 | const int w1 = w - 1; 15 | const int h1 = h - 1; 16 | 17 | std::map x0s; 18 | std::map x1s; 19 | std::map y0s; 20 | std::map y1s; 21 | std::unordered_map lookup; 22 | 23 | // find points along each edge 24 | for (int i = 0; i < points.size(); i++) { 25 | const auto &p = points[i]; 26 | bool edge = false; 27 | if (p.x == 0) { 28 | x0s[p.y] = p.z; 29 | edge = true; 30 | } else if (p.x == w1) { 31 | x1s[p.y] = p.z; 32 | edge = true; 33 | } 34 | if (p.y == 0) { 35 | y0s[p.x] = p.z; 36 | edge = true; 37 | } else if (p.y == h1) { 38 | y1s[p.x] = p.z; 39 | edge = true; 40 | } 41 | if (edge) { 42 | lookup[p] = i; 43 | } 44 | } 45 | 46 | std::vector> sx0s(x0s.begin(), x0s.end()); 47 | std::vector> sx1s(x1s.begin(), x1s.end()); 48 | std::vector> sy0s(y0s.begin(), y0s.end()); 49 | std::vector> sy1s(y1s.begin(), y1s.end()); 50 | 51 | const auto pointIndex = [&lookup, &points]( 52 | const float x, const float y, const float z) 53 | { 54 | const glm::vec3 point(x, y, z); 55 | if (lookup.find(point) == lookup.end()) { 56 | lookup[point] = points.size(); 57 | points.push_back(point); 58 | } 59 | return lookup[point]; 60 | }; 61 | 62 | // compute base center point 63 | const int center = pointIndex(w * 0.5f, h * 0.5f, z); 64 | 65 | // edge x = 0 66 | for (int i = 1; i < sx0s.size(); i++) { 67 | const int y0 = sx0s[i-1].first; 68 | const int y1 = sx0s[i].first; 69 | const float z0 = sx0s[i-1].second; 70 | const float z1 = sx0s[i].second; 71 | const int p00 = pointIndex(0, y0, z); 72 | const int p01 = pointIndex(0, y0, z0); 73 | const int p10 = pointIndex(0, y1, z); 74 | const int p11 = pointIndex(0, y1, z1); 75 | triangles.emplace_back(p01, p10, p00); 76 | triangles.emplace_back(p01, p11, p10); 77 | triangles.emplace_back(center, p00, p10); 78 | } 79 | 80 | // edge x = w1 81 | for (int i = 1; i < sx1s.size(); i++) { 82 | const int y0 = sx1s[i-1].first; 83 | const int y1 = sx1s[i].first; 84 | const float z0 = sx1s[i-1].second; 85 | const float z1 = sx1s[i].second; 86 | const int p00 = pointIndex(w1, y0, z); 87 | const int p01 = pointIndex(w1, y0, z0); 88 | const int p10 = pointIndex(w1, y1, z); 89 | const int p11 = pointIndex(w1, y1, z1); 90 | triangles.emplace_back(p00, p10, p01); 91 | triangles.emplace_back(p10, p11, p01); 92 | triangles.emplace_back(center, p10, p00); 93 | } 94 | 95 | // edge y = 0 96 | for (int i = 1; i < sy0s.size(); i++) { 97 | const int x0 = sy0s[i-1].first; 98 | const int x1 = sy0s[i].first; 99 | const float z0 = sy0s[i-1].second; 100 | const float z1 = sy0s[i].second; 101 | const int p00 = pointIndex(x0, 0, z); 102 | const int p01 = pointIndex(x0, 0, z0); 103 | const int p10 = pointIndex(x1, 0, z); 104 | const int p11 = pointIndex(x1, 0, z1); 105 | triangles.emplace_back(p00, p10, p01); 106 | triangles.emplace_back(p10, p11, p01); 107 | triangles.emplace_back(center, p10, p00); 108 | } 109 | 110 | // edge y = h1 111 | for (int i = 1; i < sy1s.size(); i++) { 112 | const int x0 = sy1s[i-1].first; 113 | const int x1 = sy1s[i].first; 114 | const float z0 = sy1s[i-1].second; 115 | const float z1 = sy1s[i].second; 116 | const int p00 = pointIndex(x0, h1, z); 117 | const int p01 = pointIndex(x0, h1, z0); 118 | const int p10 = pointIndex(x1, h1, z); 119 | const int p11 = pointIndex(x1, h1, z1); 120 | triangles.emplace_back(p01, p10, p00); 121 | triangles.emplace_back(p01, p11, p10); 122 | triangles.emplace_back(center, p00, p10); 123 | } 124 | } 125 | -------------------------------------------------------------------------------- /src/base.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | 6 | void AddBase( 7 | std::vector &points, 8 | std::vector &triangles, 9 | const int w, const int h, const float z); 10 | -------------------------------------------------------------------------------- /src/blur.cpp: -------------------------------------------------------------------------------- 1 | #include "blur.h" 2 | 3 | #include 4 | 5 | // see: http://blog.ivank.net/fastest-gaussian-blur.html 6 | 7 | namespace { 8 | 9 | std::vector BoxesForGaussian(const float sigma, const int n) { 10 | const float wIdeal = std::sqrt((12 * sigma * sigma / n) + 1); 11 | int wl = wIdeal; 12 | if (wl % 2 == 0) { 13 | wl--; 14 | } 15 | const int wu = wl + 2; 16 | 17 | const float mIdeal = 18 | (12 * sigma * sigma - n * wl * wl - 4 * n * wl - 3 * n) / 19 | (-4 * wl - 4); 20 | const int m = std::round(mIdeal); 21 | 22 | std::vector sizes; 23 | for (int i = 0; i < n; i++) { 24 | sizes.push_back(i < m ? wl : wu); 25 | } 26 | return sizes; 27 | } 28 | 29 | void BoxBlurH( 30 | std::vector &src, 31 | std::vector &dst, 32 | const int w, const int h, const int r) 33 | { 34 | const float m = 1.f / (r + r + 1); 35 | for (int i = 0; i < h; i++) { 36 | int ti = i * w; 37 | int li = ti; 38 | int ri = ti + r; 39 | float fv = src[ti]; 40 | float lv = src[ti + w - 1]; 41 | float val = (r + 1) * fv; 42 | for (int j = 0; j < r; j++) { 43 | val += src[ti + j]; 44 | } 45 | for (int j = 0; j <= r; j++) { 46 | val += src[ri] - fv; 47 | dst[ti] = val * m; 48 | ri++; 49 | ti++; 50 | } 51 | for (int j = r + 1; j < w - r; j++) { 52 | val += src[ri] - src[li]; 53 | dst[ti] = val * m; 54 | li++; 55 | ri++; 56 | ti++; 57 | } 58 | for (int j = w - r; j < w; j++) { 59 | val += lv - src[li]; 60 | dst[ti] = val * m; 61 | li++; 62 | ti++; 63 | } 64 | } 65 | } 66 | 67 | void BoxBlurV( 68 | std::vector &src, 69 | std::vector &dst, 70 | const int w, const int h, const int r) 71 | { 72 | const float m = 1.f / (r + r + 1); 73 | for (int i = 0; i < w; i++) { 74 | int ti = i; 75 | int li = ti; 76 | int ri = ti + r * w; 77 | float fv = src[ti]; 78 | float lv = src[ti + w * (h - 1)]; 79 | float val = (r + 1) * fv; 80 | for (int j = 0; j < r; j++) { 81 | val += src[ti + j * w]; 82 | } 83 | for (int j = 0; j <= r; j++) { 84 | val += src[ri] - fv; 85 | dst[ti] = val * m; 86 | ri += w; 87 | ti += w; 88 | } 89 | for (int j = r + 1; j < h - r; j++) { 90 | val += src[ri] - src[li]; 91 | dst[ti] = val * m; 92 | li += w; 93 | ri += w; 94 | ti += w; 95 | } 96 | for (int j = h - r; j < h; j++) { 97 | val += lv - src[li]; 98 | dst[ti] = val * m; 99 | li += w; 100 | ti += w; 101 | } 102 | } 103 | } 104 | 105 | 106 | void BoxBlur( 107 | std::vector &src, 108 | std::vector &dst, 109 | const int w, const int h, const int r) 110 | { 111 | dst.assign(src.begin(), src.end()); 112 | BoxBlurH(dst, src, w, h, r); 113 | BoxBlurV(src, dst, w, h, r); 114 | } 115 | 116 | } 117 | 118 | std::vector GaussianBlur( 119 | const std::vector &data, 120 | const int w, const int h, const int r) 121 | { 122 | std::vector src = data; 123 | std::vector dst(data.size()); 124 | const std::vector boxes = BoxesForGaussian(r, 3); 125 | BoxBlur(src, dst, w, h, (boxes[0] - 1) / 2); 126 | BoxBlur(dst, src, w, h, (boxes[1] - 1) / 2); 127 | BoxBlur(src, dst, w, h, (boxes[2] - 1) / 2); 128 | return dst; 129 | } 130 | -------------------------------------------------------------------------------- /src/blur.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | 5 | std::vector GaussianBlur( 6 | const std::vector &data, 7 | const int w, const int h, const int r); 8 | -------------------------------------------------------------------------------- /src/cmdline.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2009, Hideyuki Tanaka 3 | All rights reserved. 4 | 5 | Redistribution and use in source and binary forms, with or without 6 | modification, are permitted provided that the following conditions are met: 7 | * Redistributions of source code must retain the above copyright 8 | notice, this list of conditions and the following disclaimer. 9 | * Redistributions in binary form must reproduce the above copyright 10 | notice, this list of conditions and the following disclaimer in the 11 | documentation and/or other materials provided with the distribution. 12 | * Neither the name of the nor the 13 | names of its contributors may be used to endorse or promote products 14 | derived from this software without specific prior written permission. 15 | 16 | THIS SOFTWARE IS PROVIDED BY ''AS IS'' AND ANY 17 | EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 18 | WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 19 | DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY 20 | DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 21 | (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 22 | LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 23 | ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 25 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 | */ 27 | 28 | #pragma once 29 | 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | #include 37 | #include 38 | #include 39 | #include 40 | #include 41 | 42 | namespace cmdline{ 43 | 44 | namespace detail{ 45 | 46 | template 47 | class lexical_cast_t{ 48 | public: 49 | static Target cast(const Source &arg){ 50 | Target ret; 51 | std::stringstream ss; 52 | if (!(ss<>ret && ss.eof())) 53 | throw std::bad_cast(); 54 | 55 | return ret; 56 | } 57 | }; 58 | 59 | template 60 | class lexical_cast_t{ 61 | public: 62 | static Target cast(const Source &arg){ 63 | return arg; 64 | } 65 | }; 66 | 67 | template 68 | class lexical_cast_t{ 69 | public: 70 | static std::string cast(const Source &arg){ 71 | std::ostringstream ss; 72 | ss< 78 | class lexical_cast_t{ 79 | public: 80 | static Target cast(const std::string &arg){ 81 | Target ret; 82 | std::istringstream ss(arg); 83 | if (!(ss>>ret && ss.eof())) 84 | throw std::bad_cast(); 85 | return ret; 86 | } 87 | }; 88 | 89 | template 90 | struct is_same { 91 | static const bool value = false; 92 | }; 93 | 94 | template 95 | struct is_same{ 96 | static const bool value = true; 97 | }; 98 | 99 | template 100 | Target lexical_cast(const Source &arg) 101 | { 102 | return lexical_cast_t::value>::cast(arg); 103 | } 104 | 105 | static inline std::string demangle(const std::string &name) 106 | { 107 | int status=0; 108 | char *p=abi::__cxa_demangle(name.c_str(), 0, 0, &status); 109 | std::string ret(p); 110 | free(p); 111 | return ret; 112 | } 113 | 114 | template 115 | std::string readable_typename() 116 | { 117 | return demangle(typeid(T).name()); 118 | } 119 | 120 | template 121 | std::string default_value(T def) 122 | { 123 | return detail::lexical_cast(def); 124 | } 125 | 126 | template <> 127 | inline std::string readable_typename() 128 | { 129 | return "string"; 130 | } 131 | 132 | } // detail 133 | 134 | //----- 135 | 136 | class cmdline_error : public std::exception { 137 | public: 138 | cmdline_error(const std::string &msg): msg(msg){} 139 | ~cmdline_error() throw() {} 140 | const char *what() const throw() { return msg.c_str(); } 141 | private: 142 | std::string msg; 143 | }; 144 | 145 | template 146 | struct default_reader{ 147 | T operator()(const std::string &str){ 148 | return detail::lexical_cast(str); 149 | } 150 | }; 151 | 152 | template 153 | struct range_reader{ 154 | range_reader(const T &low, const T &high): low(low), high(high) {} 155 | T operator()(const std::string &s) const { 156 | T ret=default_reader()(s); 157 | if (!(ret>=low && ret<=high)) throw cmdline::cmdline_error("range_error"); 158 | return ret; 159 | } 160 | private: 161 | T low, high; 162 | }; 163 | 164 | template 165 | range_reader range(const T &low, const T &high) 166 | { 167 | return range_reader(low, high); 168 | } 169 | 170 | template 171 | struct oneof_reader{ 172 | T operator()(const std::string &s){ 173 | T ret=default_reader()(s); 174 | if (std::find(alt.begin(), alt.end(), ret)==alt.end()) 175 | throw cmdline_error(""); 176 | return ret; 177 | } 178 | void add(const T &v){ alt.push_back(v); } 179 | private: 180 | std::vector alt; 181 | }; 182 | 183 | template 184 | oneof_reader oneof(T a1) 185 | { 186 | oneof_reader ret; 187 | ret.add(a1); 188 | return ret; 189 | } 190 | 191 | template 192 | oneof_reader oneof(T a1, T a2) 193 | { 194 | oneof_reader ret; 195 | ret.add(a1); 196 | ret.add(a2); 197 | return ret; 198 | } 199 | 200 | template 201 | oneof_reader oneof(T a1, T a2, T a3) 202 | { 203 | oneof_reader ret; 204 | ret.add(a1); 205 | ret.add(a2); 206 | ret.add(a3); 207 | return ret; 208 | } 209 | 210 | template 211 | oneof_reader oneof(T a1, T a2, T a3, T a4) 212 | { 213 | oneof_reader ret; 214 | ret.add(a1); 215 | ret.add(a2); 216 | ret.add(a3); 217 | ret.add(a4); 218 | return ret; 219 | } 220 | 221 | template 222 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5) 223 | { 224 | oneof_reader ret; 225 | ret.add(a1); 226 | ret.add(a2); 227 | ret.add(a3); 228 | ret.add(a4); 229 | ret.add(a5); 230 | return ret; 231 | } 232 | 233 | template 234 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5, T a6) 235 | { 236 | oneof_reader ret; 237 | ret.add(a1); 238 | ret.add(a2); 239 | ret.add(a3); 240 | ret.add(a4); 241 | ret.add(a5); 242 | ret.add(a6); 243 | return ret; 244 | } 245 | 246 | template 247 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5, T a6, T a7) 248 | { 249 | oneof_reader ret; 250 | ret.add(a1); 251 | ret.add(a2); 252 | ret.add(a3); 253 | ret.add(a4); 254 | ret.add(a5); 255 | ret.add(a6); 256 | ret.add(a7); 257 | return ret; 258 | } 259 | 260 | template 261 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5, T a6, T a7, T a8) 262 | { 263 | oneof_reader ret; 264 | ret.add(a1); 265 | ret.add(a2); 266 | ret.add(a3); 267 | ret.add(a4); 268 | ret.add(a5); 269 | ret.add(a6); 270 | ret.add(a7); 271 | ret.add(a8); 272 | return ret; 273 | } 274 | 275 | template 276 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5, T a6, T a7, T a8, T a9) 277 | { 278 | oneof_reader ret; 279 | ret.add(a1); 280 | ret.add(a2); 281 | ret.add(a3); 282 | ret.add(a4); 283 | ret.add(a5); 284 | ret.add(a6); 285 | ret.add(a7); 286 | ret.add(a8); 287 | ret.add(a9); 288 | return ret; 289 | } 290 | 291 | template 292 | oneof_reader oneof(T a1, T a2, T a3, T a4, T a5, T a6, T a7, T a8, T a9, T a10) 293 | { 294 | oneof_reader ret; 295 | ret.add(a1); 296 | ret.add(a2); 297 | ret.add(a3); 298 | ret.add(a4); 299 | ret.add(a5); 300 | ret.add(a6); 301 | ret.add(a7); 302 | ret.add(a8); 303 | ret.add(a9); 304 | ret.add(a10); 305 | return ret; 306 | } 307 | 308 | //----- 309 | 310 | class parser{ 311 | public: 312 | parser(){ 313 | } 314 | ~parser(){ 315 | for (std::map::iterator p=options.begin(); 316 | p!=options.end(); p++) 317 | delete p->second; 318 | } 319 | 320 | void add(const std::string &name, 321 | char short_name=0, 322 | const std::string &desc=""){ 323 | if (options.count(name)) throw cmdline_error("multiple definition: "+name); 324 | options[name]=new option_without_value(name, short_name, desc); 325 | ordered.push_back(options[name]); 326 | } 327 | 328 | template 329 | void add(const std::string &name, 330 | char short_name=0, 331 | const std::string &desc="", 332 | bool need=true, 333 | const T def=T()){ 334 | add(name, short_name, desc, need, def, default_reader()); 335 | } 336 | 337 | template 338 | void add(const std::string &name, 339 | char short_name=0, 340 | const std::string &desc="", 341 | bool need=true, 342 | const T def=T(), 343 | F reader=F()){ 344 | if (options.count(name)) throw cmdline_error("multiple definition: "+name); 345 | options[name]=new option_with_value_with_reader(name, short_name, need, def, desc, reader); 346 | ordered.push_back(options[name]); 347 | } 348 | 349 | void footer(const std::string &f){ 350 | ftr=f; 351 | } 352 | 353 | void set_program_name(const std::string &name){ 354 | prog_name=name; 355 | } 356 | 357 | bool exist(const std::string &name) const { 358 | if (options.count(name)==0) throw cmdline_error("there is no flag: --"+name); 359 | return options.find(name)->second->has_set(); 360 | } 361 | 362 | template 363 | const T &get(const std::string &name) const { 364 | if (options.count(name)==0) throw cmdline_error("there is no flag: --"+name); 365 | const option_with_value *p=dynamic_cast*>(options.find(name)->second); 366 | if (p==NULL) throw cmdline_error("type mismatch flag '"+name+"'"); 367 | return p->get(); 368 | } 369 | 370 | const std::vector &rest() const { 371 | return others; 372 | } 373 | 374 | bool parse(const std::string &arg){ 375 | std::vector args; 376 | 377 | std::string buf; 378 | bool in_quote=false; 379 | for (std::string::size_type i=0; i=arg.length()){ 394 | errors.push_back("unexpected occurrence of '\\' at end of string"); 395 | return false; 396 | } 397 | } 398 | 399 | buf+=arg[i]; 400 | } 401 | 402 | if (in_quote){ 403 | errors.push_back("quote is not closed"); 404 | return false; 405 | } 406 | 407 | if (buf.length()>0) 408 | args.push_back(buf); 409 | 410 | for (size_t i=0; i &args){ 417 | int argc=static_cast(args.size()); 418 | std::vector argv(argc); 419 | 420 | for (int i=0; i lookup; 438 | for (std::map::iterator p=options.begin(); 439 | p!=options.end(); p++){ 440 | if (p->first.length()==0) continue; 441 | char initial=p->second->short_name(); 442 | if (initial){ 443 | if (lookup.count(initial)>0){ 444 | lookup[initial]=""; 445 | errors.push_back(std::string("short option '")+initial+"' is ambiguous"); 446 | return false; 447 | } 448 | else lookup[initial]=p->first; 449 | } 450 | } 451 | 452 | for (int i=1; i &args){ 534 | if (!options.count("help")) 535 | add("help", '?', "print this message"); 536 | check(args.size(), parse(args)); 537 | } 538 | 539 | void parse_check(int argc, char *argv[]){ 540 | if (!options.count("help")) 541 | add("help", '?', "print this message"); 542 | check(argc, parse(argc, argv)); 543 | } 544 | 545 | std::string error() const{ 546 | return errors.size()>0?errors[0]:""; 547 | } 548 | 549 | std::string error_full() const{ 550 | std::ostringstream oss; 551 | for (size_t i=0; imust()) 562 | oss<short_description()<<" "; 563 | } 564 | 565 | oss<<"[options] ... "<name().length()); 571 | } 572 | for (size_t i=0; ishort_name()){ 574 | oss<<" -"<short_name()<<", "; 575 | } 576 | else{ 577 | oss<<" "; 578 | } 579 | 580 | oss<<"--"<name(); 581 | for (size_t j=ordered[i]->name().length(); jdescription()<set()){ 608 | errors.push_back("option needs value: --"+name); 609 | return; 610 | } 611 | } 612 | 613 | void set_option(const std::string &name, const std::string &value){ 614 | if (options.count(name)==0){ 615 | errors.push_back("undefined option: --"+name); 616 | return; 617 | } 618 | if (!options[name]->set(value)){ 619 | errors.push_back("option value is invalid: --"+name+"="+value); 620 | return; 621 | } 622 | } 623 | 624 | class option_base{ 625 | public: 626 | virtual ~option_base(){} 627 | 628 | virtual bool has_value() const=0; 629 | virtual bool set()=0; 630 | virtual bool set(const std::string &value)=0; 631 | virtual bool has_set() const=0; 632 | virtual bool valid() const=0; 633 | virtual bool must() const=0; 634 | 635 | virtual const std::string &name() const=0; 636 | virtual char short_name() const=0; 637 | virtual const std::string &description() const=0; 638 | virtual std::string short_description() const=0; 639 | }; 640 | 641 | class option_without_value : public option_base { 642 | public: 643 | option_without_value(const std::string &name, 644 | char short_name, 645 | const std::string &desc) 646 | :nam(name), snam(short_name), desc(desc), has(false){ 647 | } 648 | ~option_without_value(){} 649 | 650 | bool has_value() const { return false; } 651 | 652 | bool set(){ 653 | has=true; 654 | return true; 655 | } 656 | 657 | bool set(const std::string &){ 658 | return false; 659 | } 660 | 661 | bool has_set() const { 662 | return has; 663 | } 664 | 665 | bool valid() const{ 666 | return true; 667 | } 668 | 669 | bool must() const{ 670 | return false; 671 | } 672 | 673 | const std::string &name() const{ 674 | return nam; 675 | } 676 | 677 | char short_name() const{ 678 | return snam; 679 | } 680 | 681 | const std::string &description() const { 682 | return desc; 683 | } 684 | 685 | std::string short_description() const{ 686 | return "--"+nam; 687 | } 688 | 689 | private: 690 | std::string nam; 691 | char snam; 692 | std::string desc; 693 | bool has; 694 | }; 695 | 696 | template 697 | class option_with_value : public option_base { 698 | public: 699 | option_with_value(const std::string &name, 700 | char short_name, 701 | bool need, 702 | const T &def, 703 | const std::string &desc) 704 | : nam(name), snam(short_name), need(need), has(false) 705 | , def(def), actual(def) { 706 | this->desc=full_description(desc); 707 | } 708 | ~option_with_value(){} 709 | 710 | const T &get() const { 711 | return actual; 712 | } 713 | 714 | bool has_value() const { return true; } 715 | 716 | bool set(){ 717 | return false; 718 | } 719 | 720 | bool set(const std::string &value){ 721 | try{ 722 | actual=read(value); 723 | has=true; 724 | } 725 | catch(const std::exception &e){ 726 | return false; 727 | } 728 | return true; 729 | } 730 | 731 | bool has_set() const{ 732 | return has; 733 | } 734 | 735 | bool valid() const{ 736 | if (need && !has) return false; 737 | return true; 738 | } 739 | 740 | bool must() const{ 741 | return need; 742 | } 743 | 744 | const std::string &name() const{ 745 | return nam; 746 | } 747 | 748 | char short_name() const{ 749 | return snam; 750 | } 751 | 752 | const std::string &description() const { 753 | return desc; 754 | } 755 | 756 | std::string short_description() const{ 757 | return "--"+nam+"="+detail::readable_typename(); 758 | } 759 | 760 | protected: 761 | std::string full_description(const std::string &desc){ 762 | return 763 | desc+" ("+detail::readable_typename()+ 764 | (need?"":" [="+detail::default_value(def)+"]") 765 | +")"; 766 | } 767 | 768 | virtual T read(const std::string &s)=0; 769 | 770 | std::string nam; 771 | char snam; 772 | bool need; 773 | std::string desc; 774 | 775 | bool has; 776 | T def; 777 | T actual; 778 | }; 779 | 780 | template 781 | class option_with_value_with_reader : public option_with_value { 782 | public: 783 | option_with_value_with_reader(const std::string &name, 784 | char short_name, 785 | bool need, 786 | const T def, 787 | const std::string &desc, 788 | F reader) 789 | : option_with_value(name, short_name, need, def, desc), reader(reader){ 790 | } 791 | 792 | private: 793 | T read(const std::string &s){ 794 | return reader(s); 795 | } 796 | 797 | F reader; 798 | }; 799 | 800 | std::map options; 801 | std::vector ordered; 802 | std::string ftr; 803 | 804 | std::string prog_name; 805 | std::vector others; 806 | 807 | std::vector errors; 808 | }; 809 | 810 | } // cmdline 811 | -------------------------------------------------------------------------------- /src/heightmap.cpp: -------------------------------------------------------------------------------- 1 | #include "heightmap.h" 2 | 3 | #define GLM_ENABLE_EXPERIMENTAL 4 | #include 5 | #include 6 | 7 | #include "blur.h" 8 | 9 | #define STB_IMAGE_IMPLEMENTATION 10 | #include "stb_image.h" 11 | 12 | #define STB_IMAGE_WRITE_IMPLEMENTATION 13 | #include "stb_image_write.h" 14 | 15 | Heightmap::Heightmap(const std::string &path) : 16 | m_Width(0), 17 | m_Height(0) 18 | { 19 | int w, h, c; 20 | uint16_t *data = stbi_load_16(path.c_str(), &w, &h, &c, 1); 21 | if (!data) { 22 | return; 23 | } 24 | m_Width = w; 25 | m_Height = h; 26 | const int n = w * h; 27 | const float m = 1.f / 65535.f; 28 | m_Data.resize(n); 29 | for (int i = 0; i < n; i++) { 30 | m_Data[i] = data[i] * m; 31 | } 32 | free(data); 33 | } 34 | 35 | Heightmap::Heightmap( 36 | const int width, 37 | const int height, 38 | const std::vector &data) : 39 | m_Width(width), 40 | m_Height(height), 41 | m_Data(data) 42 | {} 43 | 44 | void Heightmap::AutoLevel() { 45 | float lo = m_Data[0]; 46 | float hi = m_Data[0]; 47 | for (int i = 0; i < m_Data.size(); i++) { 48 | lo = std::min(lo, m_Data[i]); 49 | hi = std::max(hi, m_Data[i]); 50 | } 51 | if (hi == lo) { 52 | return; 53 | } 54 | for (int i = 0; i < m_Data.size(); i++) { 55 | m_Data[i] = (m_Data[i] - lo) / (hi - lo); 56 | } 57 | } 58 | 59 | void Heightmap::Invert() { 60 | for (int i = 0; i < m_Data.size(); i++) { 61 | m_Data[i] = 1.f - m_Data[i]; 62 | } 63 | } 64 | 65 | void Heightmap::GammaCurve(const float gamma) { 66 | for (int i = 0; i < m_Data.size(); i++) { 67 | m_Data[i] = std::pow(m_Data[i], gamma); 68 | } 69 | } 70 | 71 | void Heightmap::AddBorder(const int size, const float z) { 72 | const int w = m_Width + size * 2; 73 | const int h = m_Height + size * 2; 74 | std::vector data(w * h, z); 75 | int i = 0; 76 | for (int y = 0; y < m_Height; y++) { 77 | int j = (y + size) * w + size; 78 | for (int x = 0; x < m_Width; x++) { 79 | data[j++] = m_Data[i++]; 80 | } 81 | } 82 | m_Width = w; 83 | m_Height = h; 84 | m_Data = data; 85 | } 86 | 87 | void Heightmap::GaussianBlur(const int r) { 88 | m_Data = ::GaussianBlur(m_Data, m_Width, m_Height, r); 89 | } 90 | 91 | std::vector Heightmap::Normalmap(const float zScale) const { 92 | const int w = m_Width - 1; 93 | const int h = m_Height - 1; 94 | std::vector result(w * h); 95 | int i = 0; 96 | for (int y0 = 0; y0 < h; y0++) { 97 | const int y1 = y0 + 1; 98 | const float yc = y0 + 0.5f; 99 | for (int x0 = 0; x0 < w; x0++) { 100 | const int x1 = x0 + 1; 101 | const float xc = x0 + 0.5f; 102 | const float z00 = At(x0, y0) * -zScale; 103 | const float z01 = At(x0, y1) * -zScale; 104 | const float z10 = At(x1, y0) * -zScale; 105 | const float z11 = At(x1, y1) * -zScale; 106 | const float zc = (z00 + z01 + z10 + z11) / 4.f; 107 | const glm::vec3 p00(x0, y0, z00); 108 | const glm::vec3 p01(x0, y1, z01); 109 | const glm::vec3 p10(x1, y0, z10); 110 | const glm::vec3 p11(x1, y1, z11); 111 | const glm::vec3 pc(xc, yc, zc); 112 | const glm::vec3 n0 = glm::triangleNormal(pc, p00, p10); 113 | const glm::vec3 n1 = glm::triangleNormal(pc, p10, p11); 114 | const glm::vec3 n2 = glm::triangleNormal(pc, p11, p01); 115 | const glm::vec3 n3 = glm::triangleNormal(pc, p01, p00); 116 | result[i] = glm::normalize(n0 + n1 + n2 + n3); 117 | i++; 118 | } 119 | } 120 | return result; 121 | } 122 | 123 | void Heightmap::SaveNormalmap( 124 | const std::string &path, 125 | const float zScale) const 126 | { 127 | const std::vector nm = Normalmap(zScale); 128 | std::vector data(nm.size() * 3); 129 | int i = 0; 130 | for (glm::vec3 n : nm) { 131 | n = (n + 1.f) / 2.f; 132 | data[i++] = uint8_t(n.x * 255); 133 | data[i++] = uint8_t(n.y * 255); 134 | data[i++] = uint8_t(n.z * 255); 135 | } 136 | stbi_write_png( 137 | path.c_str(), m_Width - 1, m_Height - 1, 3, 138 | data.data(), (m_Width - 1) * 3); 139 | } 140 | 141 | void Heightmap::SaveHillshade( 142 | const std::string &path, 143 | const float zScale, 144 | const float altitude, 145 | const float azimuth) const 146 | { 147 | const glm::vec3 light = glm::euclidean(glm::vec2( 148 | glm::radians(altitude), glm::radians(-azimuth))).xzy(); 149 | const std::vector nm = Normalmap(zScale); 150 | std::vector data(nm.size() * 3); 151 | int i = 0; 152 | for (glm::vec3 n : nm) { 153 | const uint8_t d = glm::clamp(glm::dot(n, light), 0.f, 1.f) * 255; 154 | data[i++] = d; 155 | data[i++] = d; 156 | data[i++] = d; 157 | } 158 | stbi_write_png( 159 | path.c_str(), m_Width - 1, m_Height - 1, 3, 160 | data.data(), (m_Width - 1) * 3); 161 | } 162 | 163 | std::pair Heightmap::FindCandidate( 164 | const glm::ivec2 p0, 165 | const glm::ivec2 p1, 166 | const glm::ivec2 p2) const 167 | { 168 | const auto edge = []( 169 | const glm::ivec2 a, const glm::ivec2 b, const glm::ivec2 c) 170 | { 171 | return (b.x - c.x) * (a.y - c.y) - (b.y - c.y) * (a.x - c.x); 172 | }; 173 | 174 | // triangle bounding box 175 | const glm::ivec2 min = glm::min(glm::min(p0, p1), p2); 176 | const glm::ivec2 max = glm::max(glm::max(p0, p1), p2); 177 | 178 | // forward differencing variables 179 | int w00 = edge(p1, p2, min); 180 | int w01 = edge(p2, p0, min); 181 | int w02 = edge(p0, p1, min); 182 | const int a01 = p1.y - p0.y; 183 | const int b01 = p0.x - p1.x; 184 | const int a12 = p2.y - p1.y; 185 | const int b12 = p1.x - p2.x; 186 | const int a20 = p0.y - p2.y; 187 | const int b20 = p2.x - p0.x; 188 | 189 | // pre-multiplied z values at vertices 190 | const float a = edge(p0, p1, p2); 191 | const float z0 = At(p0) / a; 192 | const float z1 = At(p1) / a; 193 | const float z2 = At(p2) / a; 194 | 195 | // iterate over pixels in bounding box 196 | float maxError = 0; 197 | glm::ivec2 maxPoint(0); 198 | for (int y = min.y; y <= max.y; y++) { 199 | // compute starting offset 200 | int dx = 0; 201 | if (w00 < 0 && a12 != 0) { 202 | dx = std::max(dx, -w00 / a12); 203 | } 204 | if (w01 < 0 && a20 != 0) { 205 | dx = std::max(dx, -w01 / a20); 206 | } 207 | if (w02 < 0 && a01 != 0) { 208 | dx = std::max(dx, -w02 / a01); 209 | } 210 | 211 | int w0 = w00 + a12 * dx; 212 | int w1 = w01 + a20 * dx; 213 | int w2 = w02 + a01 * dx; 214 | 215 | bool wasInside = false; 216 | 217 | for (int x = min.x + dx; x <= max.x; x++) { 218 | // check if inside triangle 219 | if (w0 >= 0 && w1 >= 0 && w2 >= 0) { 220 | wasInside = true; 221 | 222 | // compute z using barycentric coordinates 223 | const float z = z0 * w0 + z1 * w1 + z2 * w2; 224 | const float dz = std::abs(z - At(x, y)); 225 | if (dz > maxError) { 226 | maxError = dz; 227 | maxPoint = glm::ivec2(x, y); 228 | } 229 | } else if (wasInside) { 230 | break; 231 | } 232 | 233 | w0 += a12; 234 | w1 += a20; 235 | w2 += a01; 236 | } 237 | 238 | w00 += b12; 239 | w01 += b20; 240 | w02 += b01; 241 | } 242 | 243 | if (maxPoint == p0 || maxPoint == p1 || maxPoint == p2) { 244 | maxError = 0; 245 | } 246 | 247 | return std::make_pair(maxPoint, maxError); 248 | } 249 | -------------------------------------------------------------------------------- /src/heightmap.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #define GLM_FORCE_SWIZZLE 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | class Heightmap { 10 | public: 11 | Heightmap(const std::string &path); 12 | 13 | Heightmap( 14 | const int width, 15 | const int height, 16 | const std::vector &data); 17 | 18 | int Width() const { 19 | return m_Width; 20 | } 21 | 22 | int Height() const { 23 | return m_Height; 24 | } 25 | 26 | float At(const int x, const int y) const { 27 | return m_Data[y * m_Width + x]; 28 | } 29 | 30 | float At(const glm::ivec2 p) const { 31 | return m_Data[p.y * m_Width + p.x]; 32 | } 33 | 34 | void AutoLevel(); 35 | 36 | void Invert(); 37 | 38 | void GammaCurve(const float gamma); 39 | 40 | void AddBorder(const int size, const float z); 41 | 42 | void GaussianBlur(const int r); 43 | 44 | std::vector Normalmap(const float zScale) const; 45 | 46 | void SaveNormalmap(const std::string &path, const float zScale) const; 47 | 48 | void SaveHillshade( 49 | const std::string &path, const float zScale, 50 | const float altitude, const float azimuth) const; 51 | 52 | std::pair FindCandidate( 53 | const glm::ivec2 p0, 54 | const glm::ivec2 p1, 55 | const glm::ivec2 p2) const; 56 | 57 | private: 58 | int m_Width; 59 | int m_Height; 60 | std::vector m_Data; 61 | }; 62 | -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #include "base.h" 7 | #include "cmdline.h" 8 | #include "heightmap.h" 9 | #include "stl.h" 10 | #include "triangulator.h" 11 | 12 | int main(int argc, char **argv) { 13 | const auto startTime = std::chrono::steady_clock::now(); 14 | 15 | // parse command line arguments 16 | cmdline::parser p; 17 | 18 | // long name, short name (or '\0'), description, mandatory (vs optional), 19 | // default value, constraint 20 | p.add("zscale", 'z', "z scale relative to x & y", true); 21 | p.add("zexagg", 'x', "z exaggeration", false, 1); 22 | p.add("error", 'e', "maximum triangulation error", false, 0.001); 23 | p.add("triangles", 't', "maximum number of triangles", false, 0); 24 | p.add("points", 'p', "maximum number of vertices", false, 0); 25 | p.add("base", 'b', "solid base height", false, 0); 26 | p.add("level", '\0', "auto level input to full grayscale range"); 27 | p.add("invert", '\0', "invert heightmap"); 28 | p.add("blur", '\0', "gaussian blur sigma", false, 0); 29 | p.add("gamma", '\0', "gamma curve exponent", false, 0); 30 | p.add("border-size", '\0', "border size in pixels", false, 0); 31 | p.add("border-height", '\0', "border z height", false, 1); 32 | p.add("normal-map", '\0', "path to write normal map png", false, ""); 33 | p.add("shade-path", '\0', "path to write hillshade png", false, ""); 34 | p.add("shade-alt", '\0', "hillshade light altitude", false, 45); 35 | p.add("shade-az", '\0', "hillshade light azimuth", false, 0); 36 | p.add("quiet", 'q', "suppress console output"); 37 | p.footer("infile outfile.stl"); 38 | p.parse_check(argc, argv); 39 | 40 | // infile required 41 | if (p.rest().size() < 1) { 42 | std::cerr << "infile required" << std::endl << p.usage(); 43 | std::exit(1); 44 | } 45 | 46 | // extract command line arguments 47 | const std::string inFile = p.rest()[0]; 48 | const float zScale = p.get("zscale"); 49 | const float zExaggeration = p.get("zexagg"); 50 | const float maxError = p.get("error"); 51 | const int maxTriangles = p.get("triangles"); 52 | const int maxPoints = p.get("points"); 53 | const float baseHeight = p.get("base"); 54 | const bool level = p.exist("level"); 55 | const bool invert = p.exist("invert"); 56 | const int blurSigma = p.get("blur"); 57 | const float gamma = p.get("gamma"); 58 | const int borderSize = p.get("border-size"); 59 | const float borderHeight = p.get("border-height"); 60 | const std::string normalmapPath = p.get("normal-map"); 61 | const std::string shadePath = p.get("shade-path"); 62 | const float shadeAlt = p.get("shade-alt"); 63 | const float shadeAz = p.get("shade-az"); 64 | const bool quiet = p.exist("quiet"); 65 | 66 | const bool hasOutFile = p.rest().size() > 1; 67 | const bool hasOtherFile = !normalmapPath.empty() || !shadePath.empty(); 68 | if (!hasOutFile && !hasOtherFile) { 69 | std::cerr << "outfile required" << std::endl << p.usage(); 70 | std::exit(1); 71 | } 72 | 73 | // helper function to display elapsed time of each step 74 | const auto timed = [quiet](const std::string &message) 75 | -> std::function 76 | { 77 | if (quiet) { 78 | return [](){}; 79 | } 80 | printf("%s... ", message.c_str()); 81 | fflush(stdout); 82 | const auto startTime = std::chrono::steady_clock::now(); 83 | return [message, startTime]() { 84 | const std::chrono::duration elapsed = 85 | std::chrono::steady_clock::now() - startTime; 86 | printf("%gs\n", elapsed.count()); 87 | }; 88 | }; 89 | 90 | // load heightmap 91 | auto done = timed("loading heightmap"); 92 | const auto hm = std::make_shared(inFile); 93 | done(); 94 | 95 | int w = hm->Width(); 96 | int h = hm->Height(); 97 | if (w * h == 0) { 98 | std::cerr 99 | << "invalid heightmap file (try png, jpg, etc.)" << std::endl 100 | << p.usage(); 101 | std::exit(1); 102 | } 103 | 104 | // display statistics 105 | if (!quiet) { 106 | printf(" %d x %d = %d pixels\n", w, h, w * h); 107 | } 108 | 109 | // auto level heightmap 110 | if (level) { 111 | hm->AutoLevel(); 112 | } 113 | 114 | // invert heightmap 115 | if (invert) { 116 | hm->Invert(); 117 | } 118 | 119 | // blur heightmap 120 | if (blurSigma > 0) { 121 | done = timed("blurring heightmap"); 122 | hm->GaussianBlur(blurSigma); 123 | done(); 124 | } 125 | 126 | // apply gamma curve 127 | if (gamma > 0) { 128 | hm->GammaCurve(gamma); 129 | } 130 | 131 | // add border 132 | if (borderSize > 0) { 133 | hm->AddBorder(borderSize, borderHeight); 134 | } 135 | 136 | // get updated size 137 | w = hm->Width(); 138 | h = hm->Height(); 139 | 140 | if (hasOutFile) { 141 | // triangulate 142 | done = timed("triangulating"); 143 | Triangulator tri(hm); 144 | tri.Run(maxError, maxTriangles, maxPoints); 145 | auto points = tri.Points(zScale * zExaggeration); 146 | auto triangles = tri.Triangles(); 147 | done(); 148 | 149 | // add base 150 | if (baseHeight > 0) { 151 | done = timed("adding solid base"); 152 | const float z = -baseHeight * zScale * zExaggeration; 153 | AddBase(points, triangles, w, h, z); 154 | done(); 155 | } 156 | 157 | // display statistics 158 | if (!quiet) { 159 | const int naiveTriangleCount = (w - 1) * (h - 1) * 2; 160 | printf(" error = %g\n", tri.Error()); 161 | printf(" points = %ld\n", points.size()); 162 | printf(" triangles = %ld\n", triangles.size()); 163 | printf(" vs. naive = %g%%\n", 100.f * triangles.size() / naiveTriangleCount); 164 | } 165 | 166 | // write output file 167 | done = timed("writing output"); 168 | const std::string outFile = p.rest()[1]; 169 | SaveBinarySTL(outFile, points, triangles); 170 | done(); 171 | } 172 | 173 | // compute normal map 174 | if (!normalmapPath.empty()) { 175 | done = timed("computing normal map"); 176 | hm->SaveNormalmap(normalmapPath, zScale * zExaggeration); 177 | done(); 178 | } 179 | 180 | // compute hillshade image 181 | if (!shadePath.empty()) { 182 | done = timed("computing hillshade image"); 183 | hm->SaveHillshade(shadePath, zScale * zExaggeration, shadeAlt, shadeAz); 184 | done(); 185 | } 186 | 187 | // show total elapsed time 188 | if (!quiet) { 189 | const std::chrono::duration elapsed = 190 | std::chrono::steady_clock::now() - startTime; 191 | printf("%gs\n", elapsed.count()); 192 | } 193 | 194 | return 0; 195 | } 196 | -------------------------------------------------------------------------------- /src/stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.13 - public domain - http://nothings.org/stb 2 | writes out PNG/BMP/TGA/JPEG/HDR images to C stdio - Sean Barrett 2010-2015 3 | no warranty implied; use at your own risk 4 | 5 | Before #including, 6 | 7 | #define STB_IMAGE_WRITE_IMPLEMENTATION 8 | 9 | in the file that you want to have the implementation. 10 | 11 | Will probably not work correctly with strict-aliasing optimizations. 12 | 13 | ABOUT: 14 | 15 | This header file is a library for writing images to C stdio or a callback. 16 | 17 | The PNG output is not optimal; it is 20-50% larger than the file 18 | written by a decent optimizing implementation; though providing a custom 19 | zlib compress function (see STBIW_ZLIB_COMPRESS) can mitigate that. 20 | This library is designed for source code compactness and simplicity, 21 | not optimal image file size or run-time performance. 22 | 23 | BUILDING: 24 | 25 | You can #define STBIW_ASSERT(x) before the #include to avoid using assert.h. 26 | You can #define STBIW_MALLOC(), STBIW_REALLOC(), and STBIW_FREE() to replace 27 | malloc,realloc,free. 28 | You can #define STBIW_MEMMOVE() to replace memmove() 29 | You can #define STBIW_ZLIB_COMPRESS to use a custom zlib-style compress function 30 | for PNG compression (instead of the builtin one), it must have the following signature: 31 | unsigned char * my_compress(unsigned char *data, int data_len, int *out_len, int quality); 32 | The returned data will be freed with STBIW_FREE() (free() by default), 33 | so it must be heap allocated with STBIW_MALLOC() (malloc() by default), 34 | 35 | UNICODE: 36 | 37 | If compiling for Windows and you wish to use Unicode filenames, compile 38 | with 39 | #define STBIW_WINDOWS_UTF8 40 | and pass utf8-encoded filenames. Call stbiw_convert_wchar_to_utf8 to convert 41 | Windows wchar_t filenames to utf8. 42 | 43 | USAGE: 44 | 45 | There are five functions, one for each image file format: 46 | 47 | int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 48 | int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 49 | int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 50 | int stbi_write_jpg(char const *filename, int w, int h, int comp, const void *data, int quality); 51 | int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 52 | 53 | void stbi_flip_vertically_on_write(int flag); // flag is non-zero to flip data vertically 54 | 55 | There are also five equivalent functions that use an arbitrary write function. You are 56 | expected to open/close your file-equivalent before and after calling these: 57 | 58 | int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 59 | int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 60 | int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 61 | int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 62 | int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 63 | 64 | where the callback is: 65 | void stbi_write_func(void *context, void *data, int size); 66 | 67 | You can configure it with these global variables: 68 | int stbi_write_tga_with_rle; // defaults to true; set to 0 to disable RLE 69 | int stbi_write_png_compression_level; // defaults to 8; set to higher for more compression 70 | int stbi_write_force_png_filter; // defaults to -1; set to 0..5 to force a filter mode 71 | 72 | 73 | You can define STBI_WRITE_NO_STDIO to disable the file variant of these 74 | functions, so the library will not use stdio.h at all. However, this will 75 | also disable HDR writing, because it requires stdio for formatted output. 76 | 77 | Each function returns 0 on failure and non-0 on success. 78 | 79 | The functions create an image file defined by the parameters. The image 80 | is a rectangle of pixels stored from left-to-right, top-to-bottom. 81 | Each pixel contains 'comp' channels of data stored interleaved with 8-bits 82 | per channel, in the following order: 1=Y, 2=YA, 3=RGB, 4=RGBA. (Y is 83 | monochrome color.) The rectangle is 'w' pixels wide and 'h' pixels tall. 84 | The *data pointer points to the first byte of the top-left-most pixel. 85 | For PNG, "stride_in_bytes" is the distance in bytes from the first byte of 86 | a row of pixels to the first byte of the next row of pixels. 87 | 88 | PNG creates output files with the same number of components as the input. 89 | The BMP format expands Y to RGB in the file format and does not 90 | output alpha. 91 | 92 | PNG supports writing rectangles of data even when the bytes storing rows of 93 | data are not consecutive in memory (e.g. sub-rectangles of a larger image), 94 | by supplying the stride between the beginning of adjacent rows. The other 95 | formats do not. (Thus you cannot write a native-format BMP through the BMP 96 | writer, both because it is in BGR order and because it may have padding 97 | at the end of the line.) 98 | 99 | PNG allows you to set the deflate compression level by setting the global 100 | variable 'stbi_write_png_compression_level' (it defaults to 8). 101 | 102 | HDR expects linear float data. Since the format is always 32-bit rgb(e) 103 | data, alpha (if provided) is discarded, and for monochrome data it is 104 | replicated across all three channels. 105 | 106 | TGA supports RLE or non-RLE compressed data. To use non-RLE-compressed 107 | data, set the global variable 'stbi_write_tga_with_rle' to 0. 108 | 109 | JPEG does ignore alpha channels in input data; quality is between 1 and 100. 110 | Higher quality looks better but results in a bigger image. 111 | JPEG baseline (no JPEG progressive). 112 | 113 | CREDITS: 114 | 115 | 116 | Sean Barrett - PNG/BMP/TGA 117 | Baldur Karlsson - HDR 118 | Jean-Sebastien Guay - TGA monochrome 119 | Tim Kelsey - misc enhancements 120 | Alan Hickman - TGA RLE 121 | Emmanuel Julien - initial file IO callback implementation 122 | Jon Olick - original jo_jpeg.cpp code 123 | Daniel Gibson - integrate JPEG, allow external zlib 124 | Aarni Koskela - allow choosing PNG filter 125 | 126 | bugfixes: 127 | github:Chribba 128 | Guillaume Chereau 129 | github:jry2 130 | github:romigrou 131 | Sergio Gonzalez 132 | Jonas Karlsson 133 | Filip Wasil 134 | Thatcher Ulrich 135 | github:poppolopoppo 136 | Patrick Boettcher 137 | github:xeekworx 138 | Cap Petschulat 139 | Simon Rodriguez 140 | Ivan Tikhonov 141 | github:ignotion 142 | Adam Schackart 143 | 144 | LICENSE 145 | 146 | See end of file for license information. 147 | 148 | */ 149 | 150 | #ifndef INCLUDE_STB_IMAGE_WRITE_H 151 | #define INCLUDE_STB_IMAGE_WRITE_H 152 | 153 | #include 154 | 155 | // if STB_IMAGE_WRITE_STATIC causes problems, try defining STBIWDEF to 'inline' or 'static inline' 156 | #ifndef STBIWDEF 157 | #ifdef STB_IMAGE_WRITE_STATIC 158 | #define STBIWDEF static 159 | #else 160 | #ifdef __cplusplus 161 | #define STBIWDEF extern "C" 162 | #else 163 | #define STBIWDEF extern 164 | #endif 165 | #endif 166 | #endif 167 | 168 | #ifndef STB_IMAGE_WRITE_STATIC // C++ forbids static forward declarations 169 | extern int stbi_write_tga_with_rle; 170 | extern int stbi_write_png_compression_level; 171 | extern int stbi_write_force_png_filter; 172 | #endif 173 | 174 | #ifndef STBI_WRITE_NO_STDIO 175 | STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 176 | STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 177 | STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 178 | STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 179 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); 180 | 181 | #ifdef STBI_WINDOWS_UTF8 182 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input); 183 | #endif 184 | #endif 185 | 186 | typedef void stbi_write_func(void *context, void *data, int size); 187 | 188 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 189 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 190 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 191 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 192 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 193 | 194 | STBIWDEF void stbi_flip_vertically_on_write(int flip_boolean); 195 | 196 | #endif//INCLUDE_STB_IMAGE_WRITE_H 197 | 198 | #ifdef STB_IMAGE_WRITE_IMPLEMENTATION 199 | 200 | #ifdef _WIN32 201 | #ifndef _CRT_SECURE_NO_WARNINGS 202 | #define _CRT_SECURE_NO_WARNINGS 203 | #endif 204 | #ifndef _CRT_NONSTDC_NO_DEPRECATE 205 | #define _CRT_NONSTDC_NO_DEPRECATE 206 | #endif 207 | #endif 208 | 209 | #ifndef STBI_WRITE_NO_STDIO 210 | #include 211 | #endif // STBI_WRITE_NO_STDIO 212 | 213 | #include 214 | #include 215 | #include 216 | #include 217 | 218 | #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) 219 | // ok 220 | #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) 221 | // ok 222 | #else 223 | #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." 224 | #endif 225 | 226 | #ifndef STBIW_MALLOC 227 | #define STBIW_MALLOC(sz) malloc(sz) 228 | #define STBIW_REALLOC(p,newsz) realloc(p,newsz) 229 | #define STBIW_FREE(p) free(p) 230 | #endif 231 | 232 | #ifndef STBIW_REALLOC_SIZED 233 | #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) 234 | #endif 235 | 236 | 237 | #ifndef STBIW_MEMMOVE 238 | #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) 239 | #endif 240 | 241 | 242 | #ifndef STBIW_ASSERT 243 | #include 244 | #define STBIW_ASSERT(x) assert(x) 245 | #endif 246 | 247 | #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) 248 | 249 | #ifdef STB_IMAGE_WRITE_STATIC 250 | static int stbi__flip_vertically_on_write=0; 251 | static int stbi_write_png_compression_level = 8; 252 | static int stbi_write_tga_with_rle = 1; 253 | static int stbi_write_force_png_filter = -1; 254 | #else 255 | int stbi_write_png_compression_level = 8; 256 | int stbi__flip_vertically_on_write=0; 257 | int stbi_write_tga_with_rle = 1; 258 | int stbi_write_force_png_filter = -1; 259 | #endif 260 | 261 | STBIWDEF void stbi_flip_vertically_on_write(int flag) 262 | { 263 | stbi__flip_vertically_on_write = flag; 264 | } 265 | 266 | typedef struct 267 | { 268 | stbi_write_func *func; 269 | void *context; 270 | } stbi__write_context; 271 | 272 | // initialize a callback-based context 273 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 274 | { 275 | s->func = c; 276 | s->context = context; 277 | } 278 | 279 | #ifndef STBI_WRITE_NO_STDIO 280 | 281 | static void stbi__stdio_write(void *context, void *data, int size) 282 | { 283 | fwrite(data,1,size,(FILE*) context); 284 | } 285 | 286 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 287 | #ifdef __cplusplus 288 | #define STBIW_EXTERN extern "C" 289 | #else 290 | #define STBIW_EXTERN extern 291 | #endif 292 | STBIW_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide); 293 | STBIW_EXTERN __declspec(dllimport) int __stdcall WideCharToMultiByte(unsigned int cp, unsigned long flags, const wchar_t *widestr, int cchwide, char *str, int cbmb, const char *defchar, int *used_default); 294 | 295 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input) 296 | { 297 | return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int) bufferlen, NULL, NULL); 298 | } 299 | #endif 300 | 301 | static FILE *stbiw__fopen(char const *filename, char const *mode) 302 | { 303 | FILE *f; 304 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 305 | wchar_t wMode[64]; 306 | wchar_t wFilename[1024]; 307 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename))) 308 | return 0; 309 | 310 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode))) 311 | return 0; 312 | 313 | #if _MSC_VER >= 1400 314 | if (0 != _wfopen_s(&f, wFilename, wMode)) 315 | f = 0; 316 | #else 317 | f = _wfopen(wFilename, wMode); 318 | #endif 319 | 320 | #elif defined(_MSC_VER) && _MSC_VER >= 1400 321 | if (0 != fopen_s(&f, filename, mode)) 322 | f=0; 323 | #else 324 | f = fopen(filename, mode); 325 | #endif 326 | return f; 327 | } 328 | 329 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 330 | { 331 | FILE *f = stbiw__fopen(filename, "wb"); 332 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 333 | return f != NULL; 334 | } 335 | 336 | static void stbi__end_write_file(stbi__write_context *s) 337 | { 338 | fclose((FILE *)s->context); 339 | } 340 | 341 | #endif // !STBI_WRITE_NO_STDIO 342 | 343 | typedef unsigned int stbiw_uint32; 344 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 345 | 346 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 347 | { 348 | while (*fmt) { 349 | switch (*fmt++) { 350 | case ' ': break; 351 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 352 | s->func(s->context,&x,1); 353 | break; } 354 | case '2': { int x = va_arg(v,int); 355 | unsigned char b[2]; 356 | b[0] = STBIW_UCHAR(x); 357 | b[1] = STBIW_UCHAR(x>>8); 358 | s->func(s->context,b,2); 359 | break; } 360 | case '4': { stbiw_uint32 x = va_arg(v,int); 361 | unsigned char b[4]; 362 | b[0]=STBIW_UCHAR(x); 363 | b[1]=STBIW_UCHAR(x>>8); 364 | b[2]=STBIW_UCHAR(x>>16); 365 | b[3]=STBIW_UCHAR(x>>24); 366 | s->func(s->context,b,4); 367 | break; } 368 | default: 369 | STBIW_ASSERT(0); 370 | return; 371 | } 372 | } 373 | } 374 | 375 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 376 | { 377 | va_list v; 378 | va_start(v, fmt); 379 | stbiw__writefv(s, fmt, v); 380 | va_end(v); 381 | } 382 | 383 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 384 | { 385 | s->func(s->context, &c, 1); 386 | } 387 | 388 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 389 | { 390 | unsigned char arr[3]; 391 | arr[0] = a; arr[1] = b; arr[2] = c; 392 | s->func(s->context, arr, 3); 393 | } 394 | 395 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 396 | { 397 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 398 | int k; 399 | 400 | if (write_alpha < 0) 401 | s->func(s->context, &d[comp - 1], 1); 402 | 403 | switch (comp) { 404 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 405 | case 1: 406 | if (expand_mono) 407 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 408 | else 409 | s->func(s->context, d, 1); // monochrome TGA 410 | break; 411 | case 4: 412 | if (!write_alpha) { 413 | // composite against pink background 414 | for (k = 0; k < 3; ++k) 415 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 416 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 417 | break; 418 | } 419 | /* FALLTHROUGH */ 420 | case 3: 421 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 422 | break; 423 | } 424 | if (write_alpha > 0) 425 | s->func(s->context, &d[comp - 1], 1); 426 | } 427 | 428 | static void stbiw__write_pixels(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, void *data, int write_alpha, int scanline_pad, int expand_mono) 429 | { 430 | stbiw_uint32 zero = 0; 431 | int i,j, j_end; 432 | 433 | if (y <= 0) 434 | return; 435 | 436 | if (stbi__flip_vertically_on_write) 437 | vdir *= -1; 438 | 439 | if (vdir < 0) { 440 | j_end = -1; j = y-1; 441 | } else { 442 | j_end = y; j = 0; 443 | } 444 | 445 | for (; j != j_end; j += vdir) { 446 | for (i=0; i < x; ++i) { 447 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 448 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 449 | } 450 | s->func(s->context, &zero, scanline_pad); 451 | } 452 | } 453 | 454 | static int stbiw__outfile(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, int expand_mono, void *data, int alpha, int pad, const char *fmt, ...) 455 | { 456 | if (y < 0 || x < 0) { 457 | return 0; 458 | } else { 459 | va_list v; 460 | va_start(v, fmt); 461 | stbiw__writefv(s, fmt, v); 462 | va_end(v); 463 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 464 | return 1; 465 | } 466 | } 467 | 468 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 469 | { 470 | int pad = (-x*3) & 3; 471 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 472 | "11 4 22 4" "4 44 22 444444", 473 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 474 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 475 | } 476 | 477 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 478 | { 479 | stbi__write_context s; 480 | stbi__start_write_callbacks(&s, func, context); 481 | return stbi_write_bmp_core(&s, x, y, comp, data); 482 | } 483 | 484 | #ifndef STBI_WRITE_NO_STDIO 485 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 486 | { 487 | stbi__write_context s; 488 | if (stbi__start_write_file(&s,filename)) { 489 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 490 | stbi__end_write_file(&s); 491 | return r; 492 | } else 493 | return 0; 494 | } 495 | #endif //!STBI_WRITE_NO_STDIO 496 | 497 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 498 | { 499 | int has_alpha = (comp == 2 || comp == 4); 500 | int colorbytes = has_alpha ? comp-1 : comp; 501 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 502 | 503 | if (y < 0 || x < 0) 504 | return 0; 505 | 506 | if (!stbi_write_tga_with_rle) { 507 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 508 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 509 | } else { 510 | int i,j,k; 511 | int jend, jdir; 512 | 513 | stbiw__writef(s, "111 221 2222 11", 0,0,format+8, 0,0,0, 0,0,x,y, (colorbytes + has_alpha) * 8, has_alpha * 8); 514 | 515 | if (stbi__flip_vertically_on_write) { 516 | j = 0; 517 | jend = y; 518 | jdir = 1; 519 | } else { 520 | j = y-1; 521 | jend = -1; 522 | jdir = -1; 523 | } 524 | for (; j != jend; j += jdir) { 525 | unsigned char *row = (unsigned char *) data + j * x * comp; 526 | int len; 527 | 528 | for (i = 0; i < x; i += len) { 529 | unsigned char *begin = row + i * comp; 530 | int diff = 1; 531 | len = 1; 532 | 533 | if (i < x - 1) { 534 | ++len; 535 | diff = memcmp(begin, row + (i + 1) * comp, comp); 536 | if (diff) { 537 | const unsigned char *prev = begin; 538 | for (k = i + 2; k < x && len < 128; ++k) { 539 | if (memcmp(prev, row + k * comp, comp)) { 540 | prev += comp; 541 | ++len; 542 | } else { 543 | --len; 544 | break; 545 | } 546 | } 547 | } else { 548 | for (k = i + 2; k < x && len < 128; ++k) { 549 | if (!memcmp(begin, row + k * comp, comp)) { 550 | ++len; 551 | } else { 552 | break; 553 | } 554 | } 555 | } 556 | } 557 | 558 | if (diff) { 559 | unsigned char header = STBIW_UCHAR(len - 1); 560 | s->func(s->context, &header, 1); 561 | for (k = 0; k < len; ++k) { 562 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 563 | } 564 | } else { 565 | unsigned char header = STBIW_UCHAR(len - 129); 566 | s->func(s->context, &header, 1); 567 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 568 | } 569 | } 570 | } 571 | } 572 | return 1; 573 | } 574 | 575 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 576 | { 577 | stbi__write_context s; 578 | stbi__start_write_callbacks(&s, func, context); 579 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 580 | } 581 | 582 | #ifndef STBI_WRITE_NO_STDIO 583 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 584 | { 585 | stbi__write_context s; 586 | if (stbi__start_write_file(&s,filename)) { 587 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 588 | stbi__end_write_file(&s); 589 | return r; 590 | } else 591 | return 0; 592 | } 593 | #endif 594 | 595 | // ************************************************************************************************* 596 | // Radiance RGBE HDR writer 597 | // by Baldur Karlsson 598 | 599 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 600 | 601 | static void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 602 | { 603 | int exponent; 604 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 605 | 606 | if (maxcomp < 1e-32f) { 607 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 608 | } else { 609 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 610 | 611 | rgbe[0] = (unsigned char)(linear[0] * normalize); 612 | rgbe[1] = (unsigned char)(linear[1] * normalize); 613 | rgbe[2] = (unsigned char)(linear[2] * normalize); 614 | rgbe[3] = (unsigned char)(exponent + 128); 615 | } 616 | } 617 | 618 | static void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 619 | { 620 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 621 | STBIW_ASSERT(length+128 <= 255); 622 | s->func(s->context, &lengthbyte, 1); 623 | s->func(s->context, &databyte, 1); 624 | } 625 | 626 | static void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 627 | { 628 | unsigned char lengthbyte = STBIW_UCHAR(length); 629 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 630 | s->func(s->context, &lengthbyte, 1); 631 | s->func(s->context, data, length); 632 | } 633 | 634 | static void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 635 | { 636 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 637 | unsigned char rgbe[4]; 638 | float linear[3]; 639 | int x; 640 | 641 | scanlineheader[2] = (width&0xff00)>>8; 642 | scanlineheader[3] = (width&0x00ff); 643 | 644 | /* skip RLE for images too small or large */ 645 | if (width < 8 || width >= 32768) { 646 | for (x=0; x < width; x++) { 647 | switch (ncomp) { 648 | case 4: /* fallthrough */ 649 | case 3: linear[2] = scanline[x*ncomp + 2]; 650 | linear[1] = scanline[x*ncomp + 1]; 651 | linear[0] = scanline[x*ncomp + 0]; 652 | break; 653 | default: 654 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 655 | break; 656 | } 657 | stbiw__linear_to_rgbe(rgbe, linear); 658 | s->func(s->context, rgbe, 4); 659 | } 660 | } else { 661 | int c,r; 662 | /* encode into scratch buffer */ 663 | for (x=0; x < width; x++) { 664 | switch(ncomp) { 665 | case 4: /* fallthrough */ 666 | case 3: linear[2] = scanline[x*ncomp + 2]; 667 | linear[1] = scanline[x*ncomp + 1]; 668 | linear[0] = scanline[x*ncomp + 0]; 669 | break; 670 | default: 671 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 672 | break; 673 | } 674 | stbiw__linear_to_rgbe(rgbe, linear); 675 | scratch[x + width*0] = rgbe[0]; 676 | scratch[x + width*1] = rgbe[1]; 677 | scratch[x + width*2] = rgbe[2]; 678 | scratch[x + width*3] = rgbe[3]; 679 | } 680 | 681 | s->func(s->context, scanlineheader, 4); 682 | 683 | /* RLE each component separately */ 684 | for (c=0; c < 4; c++) { 685 | unsigned char *comp = &scratch[width*c]; 686 | 687 | x = 0; 688 | while (x < width) { 689 | // find first run 690 | r = x; 691 | while (r+2 < width) { 692 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 693 | break; 694 | ++r; 695 | } 696 | if (r+2 >= width) 697 | r = width; 698 | // dump up to first run 699 | while (x < r) { 700 | int len = r-x; 701 | if (len > 128) len = 128; 702 | stbiw__write_dump_data(s, len, &comp[x]); 703 | x += len; 704 | } 705 | // if there's a run, output it 706 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 707 | // find next byte after run 708 | while (r < width && comp[r] == comp[x]) 709 | ++r; 710 | // output run up to r 711 | while (x < r) { 712 | int len = r-x; 713 | if (len > 127) len = 127; 714 | stbiw__write_run_data(s, len, comp[x]); 715 | x += len; 716 | } 717 | } 718 | } 719 | } 720 | } 721 | } 722 | 723 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 724 | { 725 | if (y <= 0 || x <= 0 || data == NULL) 726 | return 0; 727 | else { 728 | // Each component is stored separately. Allocate scratch space for full output scanline. 729 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 730 | int i, len; 731 | char buffer[128]; 732 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 733 | s->func(s->context, header, sizeof(header)-1); 734 | 735 | #ifdef __STDC_WANT_SECURE_LIB__ 736 | len = sprintf_s(buffer, sizeof(buffer), "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 737 | #else 738 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 739 | #endif 740 | s->func(s->context, buffer, len); 741 | 742 | for(i=0; i < y; i++) 743 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*x*(stbi__flip_vertically_on_write ? y-1-i : i)); 744 | STBIW_FREE(scratch); 745 | return 1; 746 | } 747 | } 748 | 749 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 750 | { 751 | stbi__write_context s; 752 | stbi__start_write_callbacks(&s, func, context); 753 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 754 | } 755 | 756 | #ifndef STBI_WRITE_NO_STDIO 757 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 758 | { 759 | stbi__write_context s; 760 | if (stbi__start_write_file(&s,filename)) { 761 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 762 | stbi__end_write_file(&s); 763 | return r; 764 | } else 765 | return 0; 766 | } 767 | #endif // STBI_WRITE_NO_STDIO 768 | 769 | 770 | ////////////////////////////////////////////////////////////////////////////// 771 | // 772 | // PNG writer 773 | // 774 | 775 | #ifndef STBIW_ZLIB_COMPRESS 776 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 777 | #define stbiw__sbraw(a) ((int *) (a) - 2) 778 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 779 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 780 | 781 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 782 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 783 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 784 | 785 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 786 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 787 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 788 | 789 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 790 | { 791 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 792 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 793 | STBIW_ASSERT(p); 794 | if (p) { 795 | if (!*arr) ((int *) p)[1] = 0; 796 | *arr = (void *) ((int *) p + 2); 797 | stbiw__sbm(*arr) = m; 798 | } 799 | return *arr; 800 | } 801 | 802 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 803 | { 804 | while (*bitcount >= 8) { 805 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 806 | *bitbuffer >>= 8; 807 | *bitcount -= 8; 808 | } 809 | return data; 810 | } 811 | 812 | static int stbiw__zlib_bitrev(int code, int codebits) 813 | { 814 | int res=0; 815 | while (codebits--) { 816 | res = (res << 1) | (code & 1); 817 | code >>= 1; 818 | } 819 | return res; 820 | } 821 | 822 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 823 | { 824 | int i; 825 | for (i=0; i < limit && i < 258; ++i) 826 | if (a[i] != b[i]) break; 827 | return i; 828 | } 829 | 830 | static unsigned int stbiw__zhash(unsigned char *data) 831 | { 832 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 833 | hash ^= hash << 3; 834 | hash += hash >> 5; 835 | hash ^= hash << 4; 836 | hash += hash >> 17; 837 | hash ^= hash << 25; 838 | hash += hash >> 6; 839 | return hash; 840 | } 841 | 842 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 843 | #define stbiw__zlib_add(code,codebits) \ 844 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 845 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 846 | // default huffman tables 847 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 848 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 849 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 850 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 851 | #define stbiw__zlib_huff(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : (n) <= 255 ? stbiw__zlib_huff2(n) : (n) <= 279 ? stbiw__zlib_huff3(n) : stbiw__zlib_huff4(n)) 852 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 853 | 854 | #define stbiw__ZHASH 16384 855 | 856 | #endif // STBIW_ZLIB_COMPRESS 857 | 858 | STBIWDEF unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 859 | { 860 | #ifdef STBIW_ZLIB_COMPRESS 861 | // user provided a zlib compress implementation, use that 862 | return STBIW_ZLIB_COMPRESS(data, data_len, out_len, quality); 863 | #else // use builtin 864 | static unsigned short lengthc[] = { 3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258, 259 }; 865 | static unsigned char lengtheb[]= { 0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0 }; 866 | static unsigned short distc[] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577, 32768 }; 867 | static unsigned char disteb[] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13 }; 868 | unsigned int bitbuf=0; 869 | int i,j, bitcount=0; 870 | unsigned char *out = NULL; 871 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(unsigned char**)); 872 | if (hash_table == NULL) 873 | return NULL; 874 | if (quality < 5) quality = 5; 875 | 876 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 877 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 878 | stbiw__zlib_add(1,1); // BFINAL = 1 879 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 880 | 881 | for (i=0; i < stbiw__ZHASH; ++i) 882 | hash_table[i] = NULL; 883 | 884 | i=0; 885 | while (i < data_len-3) { 886 | // hash next 3 bytes of data to be compressed 887 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 888 | unsigned char *bestloc = 0; 889 | unsigned char **hlist = hash_table[h]; 890 | int n = stbiw__sbcount(hlist); 891 | for (j=0; j < n; ++j) { 892 | if (hlist[j]-data > i-32768) { // if entry lies within window 893 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 894 | if (d >= best) { best=d; bestloc=hlist[j]; } 895 | } 896 | } 897 | // when hash table entry is too long, delete half the entries 898 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 899 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 900 | stbiw__sbn(hash_table[h]) = quality; 901 | } 902 | stbiw__sbpush(hash_table[h],data+i); 903 | 904 | if (bestloc) { 905 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 906 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 907 | hlist = hash_table[h]; 908 | n = stbiw__sbcount(hlist); 909 | for (j=0; j < n; ++j) { 910 | if (hlist[j]-data > i-32767) { 911 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 912 | if (e > best) { // if next match is better, bail on current match 913 | bestloc = NULL; 914 | break; 915 | } 916 | } 917 | } 918 | } 919 | 920 | if (bestloc) { 921 | int d = (int) (data+i - bestloc); // distance back 922 | STBIW_ASSERT(d <= 32767 && best <= 258); 923 | for (j=0; best > lengthc[j+1]-1; ++j); 924 | stbiw__zlib_huff(j+257); 925 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 926 | for (j=0; d > distc[j+1]-1; ++j); 927 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 928 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 929 | i += best; 930 | } else { 931 | stbiw__zlib_huffb(data[i]); 932 | ++i; 933 | } 934 | } 935 | // write out final bytes 936 | for (;i < data_len; ++i) 937 | stbiw__zlib_huffb(data[i]); 938 | stbiw__zlib_huff(256); // end of block 939 | // pad with 0 bits to byte boundary 940 | while (bitcount) 941 | stbiw__zlib_add(0,1); 942 | 943 | for (i=0; i < stbiw__ZHASH; ++i) 944 | (void) stbiw__sbfree(hash_table[i]); 945 | STBIW_FREE(hash_table); 946 | 947 | { 948 | // compute adler32 on input 949 | unsigned int s1=1, s2=0; 950 | int blocklen = (int) (data_len % 5552); 951 | j=0; 952 | while (j < data_len) { 953 | for (i=0; i < blocklen; ++i) { s1 += data[j+i]; s2 += s1; } 954 | s1 %= 65521; s2 %= 65521; 955 | j += blocklen; 956 | blocklen = 5552; 957 | } 958 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 959 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 960 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 961 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 962 | } 963 | *out_len = stbiw__sbn(out); 964 | // make returned pointer freeable 965 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 966 | return (unsigned char *) stbiw__sbraw(out); 967 | #endif // STBIW_ZLIB_COMPRESS 968 | } 969 | 970 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 971 | { 972 | #ifdef STBIW_CRC32 973 | return STBIW_CRC32(buffer, len); 974 | #else 975 | static unsigned int crc_table[256] = 976 | { 977 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 978 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 979 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 980 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 981 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 982 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 983 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 984 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 985 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 986 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 987 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 988 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 989 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 990 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 991 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 992 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 993 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 994 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 995 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 996 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 997 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 998 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 999 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 1000 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 1001 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 1002 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 1003 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 1004 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 1005 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 1006 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 1007 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 1008 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 1009 | }; 1010 | 1011 | unsigned int crc = ~0u; 1012 | int i; 1013 | for (i=0; i < len; ++i) 1014 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 1015 | return ~crc; 1016 | #endif 1017 | } 1018 | 1019 | #define stbiw__wpng4(o,a,b,c,d) ((o)[0]=STBIW_UCHAR(a),(o)[1]=STBIW_UCHAR(b),(o)[2]=STBIW_UCHAR(c),(o)[3]=STBIW_UCHAR(d),(o)+=4) 1020 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 1021 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 1022 | 1023 | static void stbiw__wpcrc(unsigned char **data, int len) 1024 | { 1025 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 1026 | stbiw__wp32(*data, crc); 1027 | } 1028 | 1029 | static unsigned char stbiw__paeth(int a, int b, int c) 1030 | { 1031 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 1032 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 1033 | if (pb <= pc) return STBIW_UCHAR(b); 1034 | return STBIW_UCHAR(c); 1035 | } 1036 | 1037 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 1038 | static void stbiw__encode_png_line(unsigned char *pixels, int stride_bytes, int width, int height, int y, int n, int filter_type, signed char *line_buffer) 1039 | { 1040 | static int mapping[] = { 0,1,2,3,4 }; 1041 | static int firstmap[] = { 0,1,0,5,6 }; 1042 | int *mymap = (y != 0) ? mapping : firstmap; 1043 | int i; 1044 | int type = mymap[filter_type]; 1045 | unsigned char *z = pixels + stride_bytes * (stbi__flip_vertically_on_write ? height-1-y : y); 1046 | int signed_stride = stbi__flip_vertically_on_write ? -stride_bytes : stride_bytes; 1047 | 1048 | if (type==0) { 1049 | memcpy(line_buffer, z, width*n); 1050 | return; 1051 | } 1052 | 1053 | // first loop isn't optimized since it's just one pixel 1054 | for (i = 0; i < n; ++i) { 1055 | switch (type) { 1056 | case 1: line_buffer[i] = z[i]; break; 1057 | case 2: line_buffer[i] = z[i] - z[i-signed_stride]; break; 1058 | case 3: line_buffer[i] = z[i] - (z[i-signed_stride]>>1); break; 1059 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-signed_stride],0)); break; 1060 | case 5: line_buffer[i] = z[i]; break; 1061 | case 6: line_buffer[i] = z[i]; break; 1062 | } 1063 | } 1064 | switch (type) { 1065 | case 1: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-n]; break; 1066 | case 2: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-signed_stride]; break; 1067 | case 3: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - ((z[i-n] + z[i-signed_stride])>>1); break; 1068 | case 4: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], z[i-signed_stride], z[i-signed_stride-n]); break; 1069 | case 5: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - (z[i-n]>>1); break; 1070 | case 6: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 1071 | } 1072 | } 1073 | 1074 | STBIWDEF unsigned char *stbi_write_png_to_mem(const unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 1075 | { 1076 | int force_filter = stbi_write_force_png_filter; 1077 | int ctype[5] = { -1, 0, 4, 2, 6 }; 1078 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 1079 | unsigned char *out,*o, *filt, *zlib; 1080 | signed char *line_buffer; 1081 | int j,zlen; 1082 | 1083 | if (stride_bytes == 0) 1084 | stride_bytes = x * n; 1085 | 1086 | if (force_filter >= 5) { 1087 | force_filter = -1; 1088 | } 1089 | 1090 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 1091 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 1092 | for (j=0; j < y; ++j) { 1093 | int filter_type; 1094 | if (force_filter > -1) { 1095 | filter_type = force_filter; 1096 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, force_filter, line_buffer); 1097 | } else { // Estimate the best filter by running through all of them: 1098 | int best_filter = 0, best_filter_val = 0x7fffffff, est, i; 1099 | for (filter_type = 0; filter_type < 5; filter_type++) { 1100 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, filter_type, line_buffer); 1101 | 1102 | // Estimate the entropy of the line using this filter; the less, the better. 1103 | est = 0; 1104 | for (i = 0; i < x*n; ++i) { 1105 | est += abs((signed char) line_buffer[i]); 1106 | } 1107 | if (est < best_filter_val) { 1108 | best_filter_val = est; 1109 | best_filter = filter_type; 1110 | } 1111 | } 1112 | if (filter_type != best_filter) { // If the last iteration already got us the best filter, don't redo it 1113 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, best_filter, line_buffer); 1114 | filter_type = best_filter; 1115 | } 1116 | } 1117 | // when we get here, filter_type contains the filter type, and line_buffer contains the data 1118 | filt[j*(x*n+1)] = (unsigned char) filter_type; 1119 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 1120 | } 1121 | STBIW_FREE(line_buffer); 1122 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, stbi_write_png_compression_level); 1123 | STBIW_FREE(filt); 1124 | if (!zlib) return 0; 1125 | 1126 | // each tag requires 12 bytes of overhead 1127 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 1128 | if (!out) return 0; 1129 | *out_len = 8 + 12+13 + 12+zlen + 12; 1130 | 1131 | o=out; 1132 | STBIW_MEMMOVE(o,sig,8); o+= 8; 1133 | stbiw__wp32(o, 13); // header length 1134 | stbiw__wptag(o, "IHDR"); 1135 | stbiw__wp32(o, x); 1136 | stbiw__wp32(o, y); 1137 | *o++ = 8; 1138 | *o++ = STBIW_UCHAR(ctype[n]); 1139 | *o++ = 0; 1140 | *o++ = 0; 1141 | *o++ = 0; 1142 | stbiw__wpcrc(&o,13); 1143 | 1144 | stbiw__wp32(o, zlen); 1145 | stbiw__wptag(o, "IDAT"); 1146 | STBIW_MEMMOVE(o, zlib, zlen); 1147 | o += zlen; 1148 | STBIW_FREE(zlib); 1149 | stbiw__wpcrc(&o, zlen); 1150 | 1151 | stbiw__wp32(o,0); 1152 | stbiw__wptag(o, "IEND"); 1153 | stbiw__wpcrc(&o,0); 1154 | 1155 | STBIW_ASSERT(o == out + *out_len); 1156 | 1157 | return out; 1158 | } 1159 | 1160 | #ifndef STBI_WRITE_NO_STDIO 1161 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1162 | { 1163 | FILE *f; 1164 | int len; 1165 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1166 | if (png == NULL) return 0; 1167 | 1168 | f = stbiw__fopen(filename, "wb"); 1169 | if (!f) { STBIW_FREE(png); return 0; } 1170 | fwrite(png, 1, len, f); 1171 | fclose(f); 1172 | STBIW_FREE(png); 1173 | return 1; 1174 | } 1175 | #endif 1176 | 1177 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int stride_bytes) 1178 | { 1179 | int len; 1180 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1181 | if (png == NULL) return 0; 1182 | func(context, png, len); 1183 | STBIW_FREE(png); 1184 | return 1; 1185 | } 1186 | 1187 | 1188 | /* *************************************************************************** 1189 | * 1190 | * JPEG writer 1191 | * 1192 | * This is based on Jon Olick's jo_jpeg.cpp: 1193 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1194 | */ 1195 | 1196 | static const unsigned char stbiw__jpg_ZigZag[] = { 0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18, 1197 | 24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63 }; 1198 | 1199 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1200 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1201 | bitCnt += bs[1]; 1202 | bitBuf |= bs[0] << (24 - bitCnt); 1203 | while(bitCnt >= 8) { 1204 | unsigned char c = (bitBuf >> 16) & 255; 1205 | stbiw__putc(s, c); 1206 | if(c == 255) { 1207 | stbiw__putc(s, 0); 1208 | } 1209 | bitBuf <<= 8; 1210 | bitCnt -= 8; 1211 | } 1212 | *bitBufP = bitBuf; 1213 | *bitCntP = bitCnt; 1214 | } 1215 | 1216 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1217 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1218 | float z1, z2, z3, z4, z5, z11, z13; 1219 | 1220 | float tmp0 = d0 + d7; 1221 | float tmp7 = d0 - d7; 1222 | float tmp1 = d1 + d6; 1223 | float tmp6 = d1 - d6; 1224 | float tmp2 = d2 + d5; 1225 | float tmp5 = d2 - d5; 1226 | float tmp3 = d3 + d4; 1227 | float tmp4 = d3 - d4; 1228 | 1229 | // Even part 1230 | float tmp10 = tmp0 + tmp3; // phase 2 1231 | float tmp13 = tmp0 - tmp3; 1232 | float tmp11 = tmp1 + tmp2; 1233 | float tmp12 = tmp1 - tmp2; 1234 | 1235 | d0 = tmp10 + tmp11; // phase 3 1236 | d4 = tmp10 - tmp11; 1237 | 1238 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1239 | d2 = tmp13 + z1; // phase 5 1240 | d6 = tmp13 - z1; 1241 | 1242 | // Odd part 1243 | tmp10 = tmp4 + tmp5; // phase 2 1244 | tmp11 = tmp5 + tmp6; 1245 | tmp12 = tmp6 + tmp7; 1246 | 1247 | // The rotator is modified from fig 4-8 to avoid extra negations. 1248 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1249 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1250 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1251 | z3 = tmp11 * 0.707106781f; // c4 1252 | 1253 | z11 = tmp7 + z3; // phase 5 1254 | z13 = tmp7 - z3; 1255 | 1256 | *d5p = z13 + z2; // phase 6 1257 | *d3p = z13 - z2; 1258 | *d1p = z11 + z4; 1259 | *d7p = z11 - z4; 1260 | 1261 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1262 | } 1263 | 1264 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1265 | int tmp1 = val < 0 ? -val : val; 1266 | val = val < 0 ? val-1 : val; 1267 | bits[1] = 1; 1268 | while(tmp1 >>= 1) { 1269 | ++bits[1]; 1270 | } 1271 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1309 | } 1310 | // end0pos = first element in reverse order !=0 1311 | if(end0pos == 0) { 1312 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1313 | return DU[0]; 1314 | } 1315 | for(i = 1; i <= end0pos; ++i) { 1316 | int startpos = i; 1317 | int nrzeroes; 1318 | unsigned short bits[2]; 1319 | for (; DU[i]==0 && i<=end0pos; ++i) { 1320 | } 1321 | nrzeroes = i-startpos; 1322 | if ( nrzeroes >= 16 ) { 1323 | int lng = nrzeroes>>4; 1324 | int nrmarker; 1325 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1326 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1327 | nrzeroes &= 15; 1328 | } 1329 | stbiw__jpg_calcBits(DU[i], bits); 1330 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1331 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1332 | } 1333 | if(end0pos != 63) { 1334 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1335 | } 1336 | return DU[0]; 1337 | } 1338 | 1339 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1340 | // Constants that don't pollute global namespace 1341 | static const unsigned char std_dc_luminance_nrcodes[] = {0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0}; 1342 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1343 | static const unsigned char std_ac_luminance_nrcodes[] = {0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d}; 1344 | static const unsigned char std_ac_luminance_values[] = { 1345 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1346 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1347 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1348 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1349 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1350 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1351 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1352 | }; 1353 | static const unsigned char std_dc_chrominance_nrcodes[] = {0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0}; 1354 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1355 | static const unsigned char std_ac_chrominance_nrcodes[] = {0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77}; 1356 | static const unsigned char std_ac_chrominance_values[] = { 1357 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1358 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1359 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1360 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1361 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1362 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1363 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1364 | }; 1365 | // Huffman tables 1366 | static const unsigned short YDC_HT[256][2] = { {0,2},{2,3},{3,3},{4,3},{5,3},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9}}; 1367 | static const unsigned short UVDC_HT[256][2] = { {0,2},{1,2},{2,2},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9},{1022,10},{2046,11}}; 1368 | static const unsigned short YAC_HT[256][2] = { 1369 | {10,4},{0,2},{1,2},{4,3},{11,4},{26,5},{120,7},{248,8},{1014,10},{65410,16},{65411,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1370 | {12,4},{27,5},{121,7},{502,9},{2038,11},{65412,16},{65413,16},{65414,16},{65415,16},{65416,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1371 | {28,5},{249,8},{1015,10},{4084,12},{65417,16},{65418,16},{65419,16},{65420,16},{65421,16},{65422,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1372 | {58,6},{503,9},{4085,12},{65423,16},{65424,16},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1373 | {59,6},{1016,10},{65430,16},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1374 | {122,7},{2039,11},{65438,16},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1375 | {123,7},{4086,12},{65446,16},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1376 | {250,8},{4087,12},{65454,16},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1377 | {504,9},{32704,15},{65462,16},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1378 | {505,9},{65470,16},{65471,16},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1379 | {506,9},{65479,16},{65480,16},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1380 | {1017,10},{65488,16},{65489,16},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1381 | {1018,10},{65497,16},{65498,16},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1382 | {2040,11},{65506,16},{65507,16},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1383 | {65515,16},{65516,16},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1384 | {2041,11},{65525,16},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1385 | }; 1386 | static const unsigned short UVAC_HT[256][2] = { 1387 | {0,2},{1,2},{4,3},{10,4},{24,5},{25,5},{56,6},{120,7},{500,9},{1014,10},{4084,12},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1388 | {11,4},{57,6},{246,8},{501,9},{2038,11},{4085,12},{65416,16},{65417,16},{65418,16},{65419,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1389 | {26,5},{247,8},{1015,10},{4086,12},{32706,15},{65420,16},{65421,16},{65422,16},{65423,16},{65424,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1390 | {27,5},{248,8},{1016,10},{4087,12},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{65430,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1391 | {58,6},{502,9},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{65438,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1392 | {59,6},{1017,10},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{65446,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1393 | {121,7},{2039,11},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{65454,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1394 | {122,7},{2040,11},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{65462,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1395 | {249,8},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{65470,16},{65471,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1396 | {503,9},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{65479,16},{65480,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1397 | {504,9},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{65488,16},{65489,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1398 | {505,9},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{65497,16},{65498,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1399 | {506,9},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{65506,16},{65507,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1400 | {2041,11},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{65515,16},{65516,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1401 | {16352,14},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{65525,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1402 | {1018,10},{32707,15},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1403 | }; 1404 | static const int YQT[] = {16,11,10,16,24,40,51,61,12,12,14,19,26,58,60,55,14,13,16,24,40,57,69,56,14,17,22,29,51,87,80,62,18,22, 1405 | 37,56,68,109,103,77,24,35,55,64,81,104,113,92,49,64,78,87,103,121,120,101,72,92,95,98,112,100,103,99}; 1406 | static const int UVQT[] = {17,18,24,47,99,99,99,99,18,21,26,66,99,99,99,99,24,26,56,99,99,99,99,99,47,66,99,99,99,99,99,99, 1407 | 99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99}; 1408 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1409 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1410 | 1411 | int row, col, i, k; 1412 | float fdtbl_Y[64], fdtbl_UV[64]; 1413 | unsigned char YTable[64], UVTable[64]; 1414 | 1415 | if(!data || !width || !height || comp > 4 || comp < 1) { 1416 | return 0; 1417 | } 1418 | 1419 | quality = quality ? quality : 90; 1420 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1421 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1422 | 1423 | for(i = 0; i < 64; ++i) { 1424 | int uvti, yti = (YQT[i]*quality+50)/100; 1425 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1426 | uvti = (UVQT[i]*quality+50)/100; 1427 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1428 | } 1429 | 1430 | for(row = 0, k = 0; row < 8; ++row) { 1431 | for(col = 0; col < 8; ++col, ++k) { 1432 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1433 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1434 | } 1435 | } 1436 | 1437 | // Write Headers 1438 | { 1439 | static const unsigned char head0[] = { 0xFF,0xD8,0xFF,0xE0,0,0x10,'J','F','I','F',0,1,1,0,0,1,0,1,0,0,0xFF,0xDB,0,0x84,0 }; 1440 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1441 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1442 | 3,1,0x11,0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1443 | s->func(s->context, (void*)head0, sizeof(head0)); 1444 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1445 | stbiw__putc(s, 1); 1446 | s->func(s->context, UVTable, sizeof(UVTable)); 1447 | s->func(s->context, (void*)head1, sizeof(head1)); 1448 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1449 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1450 | stbiw__putc(s, 0x10); // HTYACinfo 1451 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1452 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1453 | stbiw__putc(s, 1); // HTUDCinfo 1454 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1455 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1456 | stbiw__putc(s, 0x11); // HTUACinfo 1457 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1458 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1459 | s->func(s->context, (void*)head2, sizeof(head2)); 1460 | } 1461 | 1462 | // Encode 8x8 macroblocks 1463 | { 1464 | static const unsigned short fillBits[] = {0x7F, 7}; 1465 | const unsigned char *imageData = (const unsigned char *)data; 1466 | int DCY=0, DCU=0, DCV=0; 1467 | int bitBuf=0, bitCnt=0; 1468 | // comp == 2 is grey+alpha (alpha is ignored) 1469 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1470 | int x, y, pos; 1471 | for(y = 0; y < height; y += 8) { 1472 | for(x = 0; x < width; x += 8) { 1473 | float YDU[64], UDU[64], VDU[64]; 1474 | for(row = y, pos = 0; row < y+8; ++row) { 1475 | // row >= height => use last input row 1476 | int clamped_row = (row < height) ? row : height - 1; 1477 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1478 | for(col = x; col < x+8; ++col, ++pos) { 1479 | float r, g, b; 1480 | // if col >= width => use pixel from last input column 1481 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1482 | 1483 | r = imageData[p+0]; 1484 | g = imageData[p+ofsG]; 1485 | b = imageData[p+ofsB]; 1486 | YDU[pos]=+0.29900f*r+0.58700f*g+0.11400f*b-128; 1487 | UDU[pos]=-0.16874f*r-0.33126f*g+0.50000f*b; 1488 | VDU[pos]=+0.50000f*r-0.41869f*g-0.08131f*b; 1489 | } 1490 | } 1491 | 1492 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, YDU, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1493 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, UDU, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1494 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, VDU, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1495 | } 1496 | } 1497 | 1498 | // Do the bit alignment of the EOI marker 1499 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1500 | } 1501 | 1502 | // EOI 1503 | stbiw__putc(s, 0xFF); 1504 | stbiw__putc(s, 0xD9); 1505 | 1506 | return 1; 1507 | } 1508 | 1509 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1510 | { 1511 | stbi__write_context s; 1512 | stbi__start_write_callbacks(&s, func, context); 1513 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1514 | } 1515 | 1516 | 1517 | #ifndef STBI_WRITE_NO_STDIO 1518 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1519 | { 1520 | stbi__write_context s; 1521 | if (stbi__start_write_file(&s,filename)) { 1522 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1523 | stbi__end_write_file(&s); 1524 | return r; 1525 | } else 1526 | return 0; 1527 | } 1528 | #endif 1529 | 1530 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1531 | 1532 | /* Revision history 1533 | 1.11 (2019-08-11) 1534 | 1535 | 1.10 (2019-02-07) 1536 | support utf8 filenames in Windows; fix warnings and platform ifdefs 1537 | 1.09 (2018-02-11) 1538 | fix typo in zlib quality API, improve STB_I_W_STATIC in C++ 1539 | 1.08 (2018-01-29) 1540 | add stbi__flip_vertically_on_write, external zlib, zlib quality, choose PNG filter 1541 | 1.07 (2017-07-24) 1542 | doc fix 1543 | 1.06 (2017-07-23) 1544 | writing JPEG (using Jon Olick's code) 1545 | 1.05 ??? 1546 | 1.04 (2017-03-03) 1547 | monochrome BMP expansion 1548 | 1.03 ??? 1549 | 1.02 (2016-04-02) 1550 | avoid allocating large structures on the stack 1551 | 1.01 (2016-01-16) 1552 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1553 | avoid race-condition in crc initialization 1554 | minor compile issues 1555 | 1.00 (2015-09-14) 1556 | installable file IO function 1557 | 0.99 (2015-09-13) 1558 | warning fixes; TGA rle support 1559 | 0.98 (2015-04-08) 1560 | added STBIW_MALLOC, STBIW_ASSERT etc 1561 | 0.97 (2015-01-18) 1562 | fixed HDR asserts, rewrote HDR rle logic 1563 | 0.96 (2015-01-17) 1564 | add HDR output 1565 | fix monochrome BMP 1566 | 0.95 (2014-08-17) 1567 | add monochrome TGA output 1568 | 0.94 (2014-05-31) 1569 | rename private functions to avoid conflicts with stb_image.h 1570 | 0.93 (2014-05-27) 1571 | warning fixes 1572 | 0.92 (2010-08-01) 1573 | casts to unsigned char to fix warnings 1574 | 0.91 (2010-07-17) 1575 | first public release 1576 | 0.90 first internal release 1577 | */ 1578 | 1579 | /* 1580 | ------------------------------------------------------------------------------ 1581 | This software is available under 2 licenses -- choose whichever you prefer. 1582 | ------------------------------------------------------------------------------ 1583 | ALTERNATIVE A - MIT License 1584 | Copyright (c) 2017 Sean Barrett 1585 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1586 | this software and associated documentation files (the "Software"), to deal in 1587 | the Software without restriction, including without limitation the rights to 1588 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1589 | of the Software, and to permit persons to whom the Software is furnished to do 1590 | so, subject to the following conditions: 1591 | The above copyright notice and this permission notice shall be included in all 1592 | copies or substantial portions of the Software. 1593 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1594 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1595 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1596 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1597 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1598 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1599 | SOFTWARE. 1600 | ------------------------------------------------------------------------------ 1601 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1602 | This is free and unencumbered software released into the public domain. 1603 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1604 | software, either in source code form or as a compiled binary, for any purpose, 1605 | commercial or non-commercial, and by any means. 1606 | In jurisdictions that recognize copyright laws, the author or authors of this 1607 | software dedicate any and all copyright interest in the software to the public 1608 | domain. We make this dedication for the benefit of the public at large and to 1609 | the detriment of our heirs and successors. We intend this dedication to be an 1610 | overt act of relinquishment in perpetuity of all present and future rights to 1611 | this software under copyright law. 1612 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1613 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1614 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1615 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1616 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1617 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1618 | ------------------------------------------------------------------------------ 1619 | */ 1620 | -------------------------------------------------------------------------------- /src/stl.cpp: -------------------------------------------------------------------------------- 1 | #include "stl.h" 2 | 3 | #define GLM_ENABLE_EXPERIMENTAL 4 | 5 | #include 6 | #include 7 | #include 8 | 9 | void SaveBinarySTL( 10 | const std::string &path, 11 | const std::vector &points, 12 | const std::vector &triangles) 13 | { 14 | // TODO: properly handle endian-ness 15 | 16 | const uint64_t numBytes = uint64_t(triangles.size()) * 50 + 84; 17 | char *dst = (char *)calloc(numBytes, 1); 18 | 19 | const uint32_t count = triangles.size(); 20 | memcpy(dst + 80, &count, 4); 21 | 22 | for (uint32_t i = 0; i < triangles.size(); i++) { 23 | const glm::ivec3 t = triangles[i]; 24 | const glm::vec3 p0 = points[t.x]; 25 | const glm::vec3 p1 = points[t.y]; 26 | const glm::vec3 p2 = points[t.z]; 27 | const glm::vec3 normal = glm::triangleNormal(p0, p1, p2); 28 | const uint64_t idx = 84 + i * 50; 29 | memcpy(dst + idx, &normal, 12); 30 | memcpy(dst + idx + 12, &p0, 12); 31 | memcpy(dst + idx + 24, &p1, 12); 32 | memcpy(dst + idx + 36, &p2, 12); 33 | } 34 | 35 | std::fstream file(path, std::ios::out | std::ios::binary); 36 | file.write(dst, numBytes); 37 | file.close(); 38 | 39 | free(dst); 40 | } 41 | -------------------------------------------------------------------------------- /src/stl.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | void SaveBinarySTL( 8 | const std::string &path, 9 | const std::vector &points, 10 | const std::vector &triangles); 11 | -------------------------------------------------------------------------------- /src/triangulator.cpp: -------------------------------------------------------------------------------- 1 | #include "triangulator.h" 2 | 3 | #include 4 | 5 | Triangulator::Triangulator(const std::shared_ptr &heightmap) : 6 | m_Heightmap(heightmap) {} 7 | 8 | void Triangulator::Run( 9 | const float maxError, 10 | const int maxTriangles, 11 | const int maxPoints) 12 | { 13 | // add points at all four corners 14 | const int x0 = 0; 15 | const int y0 = 0; 16 | const int x1 = m_Heightmap->Width() - 1; 17 | const int y1 = m_Heightmap->Height() - 1; 18 | const int p0 = AddPoint(glm::ivec2(x0, y0)); 19 | const int p1 = AddPoint(glm::ivec2(x1, y0)); 20 | const int p2 = AddPoint(glm::ivec2(x0, y1)); 21 | const int p3 = AddPoint(glm::ivec2(x1, y1)); 22 | 23 | // add initial two triangles 24 | const int t0 = AddTriangle(p3, p0, p2, -1, -1, -1, -1); 25 | AddTriangle(p0, p3, p1, t0, -1, -1, -1); 26 | Flush(); 27 | 28 | // helper function to check if triangulation is complete 29 | const auto done = [this, maxError, maxTriangles, maxPoints]() { 30 | const float e = Error(); 31 | if (e <= maxError) { 32 | return true; 33 | } 34 | if (maxTriangles > 0 && NumTriangles() >= maxTriangles) { 35 | return true; 36 | } 37 | if (maxPoints > 0 && NumPoints() >= maxPoints) { 38 | return true; 39 | } 40 | return e == 0; 41 | }; 42 | 43 | while (!done()) { 44 | Step(); 45 | } 46 | } 47 | 48 | float Triangulator::Error() const { 49 | return m_Errors[m_Queue[0]]; 50 | } 51 | 52 | std::vector Triangulator::Points(const float zScale) const { 53 | std::vector points; 54 | points.reserve(m_Points.size()); 55 | const int h1 = m_Heightmap->Height() - 1; 56 | for (const glm::ivec2 &p : m_Points) { 57 | points.emplace_back(p.x, h1 - p.y, m_Heightmap->At(p.x, p.y) * zScale); 58 | } 59 | return points; 60 | } 61 | 62 | std::vector Triangulator::Triangles() const { 63 | std::vector triangles; 64 | triangles.reserve(m_Queue.size()); 65 | for (const int i : m_Queue) { 66 | triangles.emplace_back( 67 | m_Triangles[i * 3 + 0], 68 | m_Triangles[i * 3 + 1], 69 | m_Triangles[i * 3 + 2]); 70 | } 71 | return triangles; 72 | } 73 | 74 | void Triangulator::Flush() { 75 | for (const int t : m_Pending) { 76 | // rasterize triangle to find maximum pixel error 77 | const auto pair = m_Heightmap->FindCandidate( 78 | m_Points[m_Triangles[t*3+0]], 79 | m_Points[m_Triangles[t*3+1]], 80 | m_Points[m_Triangles[t*3+2]]); 81 | // update metadata 82 | m_Candidates[t] = pair.first; 83 | m_Errors[t] = pair.second; 84 | // add triangle to priority queue 85 | QueuePush(t); 86 | } 87 | 88 | m_Pending.clear(); 89 | } 90 | 91 | void Triangulator::Step() { 92 | // pop triangle with highest error from priority queue 93 | const int t = QueuePop(); 94 | 95 | const int e0 = t * 3 + 0; 96 | const int e1 = t * 3 + 1; 97 | const int e2 = t * 3 + 2; 98 | 99 | const int p0 = m_Triangles[e0]; 100 | const int p1 = m_Triangles[e1]; 101 | const int p2 = m_Triangles[e2]; 102 | 103 | const glm::ivec2 a = m_Points[p0]; 104 | const glm::ivec2 b = m_Points[p1]; 105 | const glm::ivec2 c = m_Points[p2]; 106 | const glm::ivec2 p = m_Candidates[t]; 107 | 108 | const int pn = AddPoint(p); 109 | 110 | const auto collinear = []( 111 | const glm::ivec2 p0, const glm::ivec2 p1, const glm::ivec2 p2) 112 | { 113 | return (p1.y-p0.y)*(p2.x-p1.x) == (p2.y-p1.y)*(p1.x-p0.x); 114 | }; 115 | 116 | const auto handleCollinear = [this](const int pn, const int a) { 117 | const int a0 = a - a % 3; 118 | const int al = a0 + (a + 1) % 3; 119 | const int ar = a0 + (a + 2) % 3; 120 | const int p0 = m_Triangles[ar]; 121 | const int pr = m_Triangles[a]; 122 | const int pl = m_Triangles[al]; 123 | const int hal = m_Halfedges[al]; 124 | const int har = m_Halfedges[ar]; 125 | 126 | const int b = m_Halfedges[a]; 127 | 128 | if (b < 0) { 129 | const int t0 = AddTriangle(pn, p0, pr, -1, har, -1, a0); 130 | const int t1 = AddTriangle(p0, pn, pl, t0, -1, hal, -1); 131 | Legalize(t0 + 1); 132 | Legalize(t1 + 2); 133 | return; 134 | } 135 | 136 | const int b0 = b - b % 3; 137 | const int bl = b0 + (b + 2) % 3; 138 | const int br = b0 + (b + 1) % 3; 139 | const int p1 = m_Triangles[bl]; 140 | const int hbl = m_Halfedges[bl]; 141 | const int hbr = m_Halfedges[br]; 142 | 143 | QueueRemove(b / 3); 144 | 145 | const int t0 = AddTriangle(p0, pr, pn, har, -1, -1, a0); 146 | const int t1 = AddTriangle(pr, p1, pn, hbr, -1, t0 + 1, b0); 147 | const int t2 = AddTriangle(p1, pl, pn, hbl, -1, t1 + 1, -1); 148 | const int t3 = AddTriangle(pl, p0, pn, hal, t0 + 2, t2 + 1, -1); 149 | 150 | Legalize(t0); 151 | Legalize(t1); 152 | Legalize(t2); 153 | Legalize(t3); 154 | }; 155 | 156 | if (collinear(a, b, p)) { 157 | handleCollinear(pn, e0); 158 | } else if (collinear(b, c, p)) { 159 | handleCollinear(pn, e1); 160 | } else if (collinear(c, a, p)) { 161 | handleCollinear(pn, e2); 162 | } else { 163 | const int h0 = m_Halfedges[e0]; 164 | const int h1 = m_Halfedges[e1]; 165 | const int h2 = m_Halfedges[e2]; 166 | 167 | const int t0 = AddTriangle(p0, p1, pn, h0, -1, -1, e0); 168 | const int t1 = AddTriangle(p1, p2, pn, h1, -1, t0 + 1, -1); 169 | const int t2 = AddTriangle(p2, p0, pn, h2, t0 + 2, t1 + 1, -1); 170 | 171 | Legalize(t0); 172 | Legalize(t1); 173 | Legalize(t2); 174 | } 175 | 176 | Flush(); 177 | } 178 | 179 | int Triangulator::AddPoint(const glm::ivec2 point) { 180 | const int i = m_Points.size(); 181 | m_Points.push_back(point); 182 | return i; 183 | } 184 | 185 | int Triangulator::AddTriangle( 186 | const int a, const int b, const int c, 187 | const int ab, const int bc, const int ca, 188 | int e) 189 | { 190 | if (e < 0) { 191 | // new halfedge index 192 | e = m_Triangles.size(); 193 | // add triangle vertices 194 | m_Triangles.push_back(a); 195 | m_Triangles.push_back(b); 196 | m_Triangles.push_back(c); 197 | // add triangle halfedges 198 | m_Halfedges.push_back(ab); 199 | m_Halfedges.push_back(bc); 200 | m_Halfedges.push_back(ca); 201 | // add triangle metadata 202 | m_Candidates.emplace_back(0); 203 | m_Errors.push_back(0); 204 | m_QueueIndexes.push_back(-1); 205 | } else { 206 | // set triangle vertices 207 | m_Triangles[e + 0] = a; 208 | m_Triangles[e + 1] = b; 209 | m_Triangles[e + 2] = c; 210 | // set triangle halfedges 211 | m_Halfedges[e + 0] = ab; 212 | m_Halfedges[e + 1] = bc; 213 | m_Halfedges[e + 2] = ca; 214 | } 215 | 216 | // link neighboring halfedges 217 | if (ab >= 0) { 218 | m_Halfedges[ab] = e + 0; 219 | } 220 | if (bc >= 0) { 221 | m_Halfedges[bc] = e + 1; 222 | } 223 | if (ca >= 0) { 224 | m_Halfedges[ca] = e + 2; 225 | } 226 | 227 | // add triangle to pending queue for later rasterization 228 | const int t = e / 3; 229 | m_Pending.push_back(t); 230 | 231 | // return first halfedge index 232 | return e; 233 | } 234 | 235 | void Triangulator::Legalize(const int a) { 236 | // if the pair of triangles doesn't satisfy the Delaunay condition 237 | // (p1 is inside the circumcircle of [p0, pl, pr]), flip them, 238 | // then do the same check/flip recursively for the new pair of triangles 239 | // 240 | // pl pl 241 | // /||\ / \ 242 | // al/ || \bl al/ \a 243 | // / || \ / \ 244 | // / a||b \ flip /___ar___\ 245 | // p0\ || /p1 => p0\---bl---/p1 246 | // \ || / \ / 247 | // ar\ || /br b\ /br 248 | // \||/ \ / 249 | // pr pr 250 | 251 | const auto inCircle = []( 252 | const glm::ivec2 a, const glm::ivec2 b, const glm::ivec2 c, 253 | const glm::ivec2 p) 254 | { 255 | const int64_t dx = a.x - p.x; 256 | const int64_t dy = a.y - p.y; 257 | const int64_t ex = b.x - p.x; 258 | const int64_t ey = b.y - p.y; 259 | const int64_t fx = c.x - p.x; 260 | const int64_t fy = c.y - p.y; 261 | const int64_t ap = dx * dx + dy * dy; 262 | const int64_t bp = ex * ex + ey * ey; 263 | const int64_t cp = fx * fx + fy * fy; 264 | return dx*(ey*cp-bp*fy)-dy*(ex*cp-bp*fx)+ap*(ex*fy-ey*fx) < 0; 265 | }; 266 | 267 | const int b = m_Halfedges[a]; 268 | 269 | if (b < 0) { 270 | return; 271 | } 272 | 273 | const int a0 = a - a % 3; 274 | const int b0 = b - b % 3; 275 | const int al = a0 + (a + 1) % 3; 276 | const int ar = a0 + (a + 2) % 3; 277 | const int bl = b0 + (b + 2) % 3; 278 | const int br = b0 + (b + 1) % 3; 279 | const int p0 = m_Triangles[ar]; 280 | const int pr = m_Triangles[a]; 281 | const int pl = m_Triangles[al]; 282 | const int p1 = m_Triangles[bl]; 283 | 284 | if (!inCircle(m_Points[p0], m_Points[pr], m_Points[pl], m_Points[p1])) { 285 | return; 286 | } 287 | 288 | const int hal = m_Halfedges[al]; 289 | const int har = m_Halfedges[ar]; 290 | const int hbl = m_Halfedges[bl]; 291 | const int hbr = m_Halfedges[br]; 292 | 293 | QueueRemove(a / 3); 294 | QueueRemove(b / 3); 295 | 296 | const int t0 = AddTriangle(p0, p1, pl, -1, hbl, hal, a0); 297 | const int t1 = AddTriangle(p1, p0, pr, t0, har, hbr, b0); 298 | 299 | Legalize(t0 + 1); 300 | Legalize(t1 + 2); 301 | } 302 | 303 | // priority queue functions 304 | 305 | void Triangulator::QueuePush(const int t) { 306 | const int i = m_Queue.size(); 307 | m_QueueIndexes[t] = i; 308 | m_Queue.push_back(t); 309 | QueueUp(i); 310 | } 311 | 312 | int Triangulator::QueuePop() { 313 | const int n = m_Queue.size() - 1; 314 | QueueSwap(0, n); 315 | QueueDown(0, n); 316 | return QueuePopBack(); 317 | } 318 | 319 | int Triangulator::QueuePopBack() { 320 | const int t = m_Queue.back(); 321 | m_Queue.pop_back(); 322 | m_QueueIndexes[t] = -1; 323 | return t; 324 | } 325 | 326 | void Triangulator::QueueRemove(const int t) { 327 | const int i = m_QueueIndexes[t]; 328 | if (i < 0) { 329 | const auto it = std::find(m_Pending.begin(), m_Pending.end(), t); 330 | if (it != m_Pending.end()) { 331 | std::swap(*it, m_Pending.back()); 332 | m_Pending.pop_back(); 333 | } else { 334 | // this shouldn't happen! 335 | } 336 | return; 337 | } 338 | const int n = m_Queue.size() - 1; 339 | if (n != i) { 340 | QueueSwap(i, n); 341 | if (!QueueDown(i, n)) { 342 | QueueUp(i); 343 | } 344 | } 345 | QueuePopBack(); 346 | } 347 | 348 | bool Triangulator::QueueLess(const int i, const int j) const { 349 | return -m_Errors[m_Queue[i]] < -m_Errors[m_Queue[j]]; 350 | } 351 | 352 | void Triangulator::QueueSwap(const int i, const int j) { 353 | const int pi = m_Queue[i]; 354 | const int pj = m_Queue[j]; 355 | m_Queue[i] = pj; 356 | m_Queue[j] = pi; 357 | m_QueueIndexes[pi] = j; 358 | m_QueueIndexes[pj] = i; 359 | } 360 | 361 | void Triangulator::QueueUp(const int j0) { 362 | int j = j0; 363 | while (1) { 364 | int i = (j - 1) / 2; 365 | if (i == j || !QueueLess(j, i)) { 366 | break; 367 | } 368 | QueueSwap(i, j); 369 | j = i; 370 | } 371 | } 372 | 373 | bool Triangulator::QueueDown(const int i0, const int n) { 374 | int i = i0; 375 | while (1) { 376 | const int j1 = 2 * i + 1; 377 | if (j1 >= n || j1 < 0) { 378 | break; 379 | } 380 | const int j2 = j1 + 1; 381 | int j = j1; 382 | if (j2 < n && QueueLess(j2, j1)) { 383 | j = j2; 384 | } 385 | if (!QueueLess(j, i)) { 386 | break; 387 | } 388 | QueueSwap(i, j); 389 | i = j; 390 | } 391 | return i > i0; 392 | } 393 | -------------------------------------------------------------------------------- /src/triangulator.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | #include "heightmap.h" 8 | 9 | class Triangulator { 10 | public: 11 | Triangulator(const std::shared_ptr &heightmap); 12 | 13 | void Run( 14 | const float maxError, 15 | const int maxTriangles, 16 | const int maxPoints); 17 | 18 | int NumPoints() const { 19 | return m_Points.size(); 20 | } 21 | 22 | int NumTriangles() const { 23 | return m_Queue.size(); 24 | } 25 | 26 | float Error() const; 27 | 28 | std::vector Points(const float zScale) const; 29 | 30 | std::vector Triangles() const; 31 | 32 | private: 33 | void Flush(); 34 | 35 | void Step(); 36 | 37 | int AddPoint(const glm::ivec2 point); 38 | 39 | int AddTriangle( 40 | const int a, const int b, const int c, 41 | const int ab, const int bc, const int ca, 42 | int e); 43 | 44 | void Legalize(const int a); 45 | 46 | void QueuePush(const int t); 47 | int QueuePop(); 48 | int QueuePopBack(); 49 | void QueueRemove(const int t); 50 | bool QueueLess(const int i, const int j) const; 51 | void QueueSwap(const int i, const int j); 52 | void QueueUp(const int j0); 53 | bool QueueDown(const int i0, const int n); 54 | 55 | std::shared_ptr m_Heightmap; 56 | 57 | std::vector m_Points; 58 | 59 | std::vector m_Triangles; 60 | std::vector m_Halfedges; 61 | 62 | std::vector m_Candidates; 63 | std::vector m_Errors; 64 | std::vector m_QueueIndexes; 65 | 66 | std::vector m_Queue; 67 | 68 | std::vector m_Pending; 69 | }; 70 | --------------------------------------------------------------------------------