-
Separate gamut, coordinates, and output encoding. A Display P3 gamut represented in Oklab is still a P3 gamut. Construct each requested gamut independently; never derive sRGB by clipping P3.
-
Use accurate color-space conversions. Keep conversions consistent with the source gamut, white point, and transfer function. A tested library such as culori can provide the math; no particular library is required. Generate a continuous boundary mesh and assign accurate vertex colors. Do not artificially remove chroma near black or white.
-
Choose an explicit output pipeline. For direct WebGPU, use
rgba16floatfor color attachments, MSAA, and resolve; configure the canvas withcolorSpace: 'display-p3',alphaMode: 'opaque', andtoneMapping: { mode: 'standard' }for SDR color samples. -
Apply the transfer function exactly once. That canvas expects encoded Display P3 values. Float16 storage does not imply linear encoding. With Three.js or another framework, in
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "title": "Run apps", | |
| "rules": [ | |
| { | |
| "description": "Run Safari", | |
| "manipulators": [ | |
| { | |
| "from": { | |
| "key_code": "left_command", | |
| "modifiers": { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: mit |
I hereby claim:
- I am devgru on github.
- I am devgru (https://keybase.io/devgru) on keybase.
- I have a public key whose fingerprint is CAAA 4087 855D AB51 327E 9372 9804 3402 64BA EDD9
To claim this, I am signing this object:
Forked from https://gist.github.com/veltman/403f95aee728d4a043b142c52c113f82
Implementing a variation of Joachim Ungar's curved label placement method described here. The basic process is:
- Turn the shape into a polygon of evenly-spaced points.
- Generate a Voronoi diagram of those points.
- Clip the edges.
- Turn the edges into a graph.
- Find the "longest shortest path" between any pair of perimeter nodes.
- Smooth/simplify that path a bit.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: gpl-3.0 | |
| height: 960 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| border: no | |
| license: gpl-3.0 |
NewerOlder