[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AP2MBGKNQ1T329AVQK7PB9":3,"skill-same:01M7AP2MBGKNQ1T329AVQK7PB9":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7AP2MBGKNQ1T329AVQK7PB9","gfx-transforms-rasterization-and-rendering",null,"Use when working on how an image gets made: transforms and projective geometry including homogeneous coordinates, the camera matrix and the projection pipeline; rasterization and its coverage, depth and interpolation rules; shading and physically based rendering with BRDFs, energy conservation and material parameters; and ray tracing with the rendering equation, Monte Carlo integration and importance sampling. Includes the router for the whole graphics-and-vision reference.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fgraphics-and-vision\u002Fskills\u002Fgfx-transforms-rasterization-and-rendering\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: gfx-transforms-rasterization-and-rendering\ndescription: \"Use when working on how an image gets made: transforms and projective geometry including homogeneous coordinates, the camera matrix and the projection pipeline; rasterization and its coverage, depth and interpolation rules; shading and physically based rendering with BRDFs, energy conservation and material parameters; and ray tracing with the rendering equation, Monte Carlo integration and importance sampling. Includes the router for the whole graphics-and-vision reference.\"\n---\n\n# Graphics and Vision: Transforms, Rasterization, Shading, and Ray Tracing\n\n> **Part 1 of 5** of the *Graphics and Vision* reference (plugin `graphics-and-vision`), covering §0–§4. Sibling skills: `gfx-gpu-real-time-techniques-and-colour` (§5–§7), `gfx-image-formation-classical-vision-and-geometry` (§8–§10), `gfx-deep-learning-neural-rendering-and-performance` (§11–§13), `gfx-reference` (§14–§19). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The mathematics is permanent — projective geometry, the rendering equation, epipolar geometry. Neural rendering and vision foundation models moved. See §16 → `gfx-reference` for those.\n\n> **Why one document.** ⚠️ **They are inverse problems over the same geometry.** Graphics\n> goes scene → image; vision goes image → scene. **They share the camera model, projective\n> geometry, and increasingly the representations** — §12 → `gfx-deep-learning-neural-rendering-and-performance` is where they now meet directly.\n>\n> **⚠️ GOTCHA** boxes mark where the math is subtle or the standard implementation is\n> silently wrong.\n>\n> **The three ideas that unify the whole document:**\n> 1. **⚠️ Homogeneous coordinates make projection linear.** Adding a fourth component turns\n>    perspective — a nonlinear operation — into a matrix multiply, which is why the entire\n>    pipeline is matrices (§1).\n> 2. **⚠️ Rendering is an integral, and everything real-time is a sampling strategy for\n>    it.** The rendering equation is the ground truth; rasterization, path tracing, and\n>    every approximation in §6 → `gfx-gpu-real-time-techniques-and-colour` are ways of estimating it under a time budget (§4).\n> 3. **⚠️ Vision is underdetermined and that is not a solvable bug.** A single image is a\n>    projection; depth is destroyed. Every vision method is adding a constraint — multiple\n>    views, motion, a learned prior — to recover what the projection threw away (§8 → `gfx-image-formation-classical-vision-and-geometry`, §10 → `gfx-image-formation-classical-vision-and-geometry`).\n\n---\n\n## §0. Routing\n\n| You want... | Go to |\n|---|---|\n| **Transforms and projective geometry** | **§1** |\n| Rasterization pipeline | §2 |\n| **Shading, PBR, the rendering equation** | **§3, §4** |\n| Ray and path tracing | §4 |\n| GPU architecture and APIs | §5 → `gfx-gpu-real-time-techniques-and-colour` |\n| **Real-time techniques** | **§6 → `gfx-gpu-real-time-techniques-and-colour`** |\n| Colour and tone mapping | §7 → `gfx-gpu-real-time-techniques-and-colour` |\n| **Camera model and calibration** | **§8 → `gfx-image-formation-classical-vision-and-geometry`** |\n| Classical CV | §9 → `gfx-image-formation-classical-vision-and-geometry` |\n| **Multiple view geometry, SfM, SLAM** | **§10 → `gfx-image-formation-classical-vision-and-geometry`** |\n| Deep learning for vision | §11 → `gfx-deep-learning-neural-rendering-and-performance` |\n| **Neural rendering (NeRF, 3DGS)** | **§12 → `gfx-deep-learning-neural-rendering-and-performance`** |\n| Performance | §13 → `gfx-deep-learning-neural-rendering-and-performance` |\n| Anti-patterns | §14 → `gfx-reference` |\n| Numbers | §15 → `gfx-reference` |\n| **What actually moved** | **§16 → `gfx-reference`** |\n| Books | §17 → `gfx-reference` |\n| Quick reference | §18 → `gfx-reference` |\n\n---\n\n## §1. Transforms and Projective Geometry\n\n**Homogeneous coordinates**: a 3D point becomes `(x, y, z, w)`, with the Euclidean point\nrecovered as `(x\u002Fw, y\u002Fw, z\u002Fw)`. ⚠️ **`w = 0` denotes a point at infinity — a direction.**\n**This is why you must transform normals and positions differently**: positions are\n`(x,y,z,1)`, directions `(x,y,z,0)`, so translation applies to one and not the other.\n\n**The pipeline of spaces:**\n```\nModel → [model matrix] → World → [view matrix] → View\u002FCamera\n      → [projection] → Clip → [÷w, perspective divide] → NDC\n      → [viewport] → Screen\n```\n**⚠️ The perspective divide is where the nonlinearity enters** — everything before it is\nlinear, which is the entire point of homogeneous coordinates.\n\n**⚠️ Normal transformation is the classic bug**: normals transform by the **inverse\ntranspose** of the model matrix, not the matrix itself. **Under non-uniform scaling, using\nthe model matrix skews normals off the surface and your lighting is wrong** in a way that\nlooks like a shading bug rather than a math bug.\n\n**Rotations**: matrices (composable, 9 numbers, drift under repeated multiplication),\n**Euler angles** (⚠️ **intuitive and gimbal-locked — avoid for interpolation or\naccumulation**), **quaternions** (⚠️ **4 numbers, no gimbal lock, and `slerp` interpolates\ncorrectly — the right internal representation**; note `q` and `−q` are the same rotation,\nwhich trips comparison and naive interpolation), **axis-angle**, and **Lie algebra\n(SO(3)\u002FSE(3))** — ⚠️ **the right formulation for optimization, because it gives you a\nminimal, unconstrained local parameterization**, which is why SLAM and bundle adjustment\nuse it (§10 → `gfx-image-formation-classical-vision-and-geometry`).\n\n**⚠️ Conventions that cause days of confusion**: row-vector vs column-vector, row-major vs\ncolumn-major storage, left- vs right-handed coordinates, and **NDC depth range —\nOpenGL's `[-1,1]` vs D3D\u002FVulkan\u002FMetal's `[0,1]`.** **Write yours down at the top of the\nfile.**\n\n---\n\n## §2. Rasterization\n\n```\nVertex data → vertex shader → [optional tessellation, geometry]\n  → clipping → perspective divide → viewport transform\n    → triangle setup → RASTERIZE → early-Z → fragment shader\n      → depth\u002Fstencil test → blend → framebuffer\n```\n\n**Rasterization** determines coverage: for each pixel, is its centre inside the triangle?\n**Edge functions** (Pineda) give this as three sign tests, and ⚠️ **they're incrementally\nevaluable, which is why hardware does it this way.**\n\n**⚠️ Perspective-correct interpolation is essential and non-obvious**: interpolating an\nattribute linearly in screen space is wrong under perspective. **Interpolate `attr\u002Fw` and\n`1\u002Fw` linearly, then divide.** ⚠️ **Getting this wrong produces the classic warped-texture\nartifact of early 3D hardware.**\n\n**Depth**: the Z-buffer. ⚠️ **Depth precision is non-linearly distributed** — most\nprecision sits near the near plane, so **z-fighting at distance is caused by a near plane\nthat is too close, far more often than by a far plane that is too far.** **Reversed-Z with\na floating-point depth buffer** largely fixes this and is the modern default.\n\n**Culling**: backface (winding order), frustum, occlusion, and **early-Z** — ⚠️ **which is\ndisabled if the fragment shader writes depth or uses `discard`, and that is a common\nsilent performance cliff.**\n\n**Texturing**: UV mapping, filtering (nearest, bilinear, trilinear, **anisotropic**),\n**mipmaps** (⚠️ **not an optimization — they're antialiasing in the texture domain, and\nwithout them minified textures shimmer**), wrap modes, and compressed formats (BC\u002FDXT,\nASTC, ETC).\n\n---\n\n## §3. Shading and PBR\n\n**The BRDF** `f_r(ω_i, ω_o)` describes how light scatters at a surface. ⚠️ **A physically\nvalid BRDF must obey reciprocity (`f_r(ω_i,ω_o) = f_r(ω_o,ω_i)`) and energy conservation\n(it cannot reflect more than it receives).**\n\n**Legacy models**: Lambert diffuse (`n·l`), Phong and Blinn-Phong specular —\n⚠️ **not energy-conserving and not reciprocal, but cheap and still everywhere.**\n\n**Modern microfacet PBR** — the standard, built as `D · F · G \u002F (4 (n·l)(n·v))`:\n- **D — normal distribution function** (⚠️ **GGX\u002FTrowbridge-Reitz won because its long\n  tail matches measured materials far better than Beckmann**).\n- **F — Fresnel** (⚠️ **Schlick's approximation; reflectance rises to 1 at grazing angles\n  for every material, which is the single most important visual cue PBR added**).\n- **G — geometry\u002Fshadowing-masking term** (Smith).\n\n**⚠️ The parameterization that won**: **base colour, metallic, roughness**, plus normal,\nAO, and emissive. **Metallic is a near-binary switch** — metals have no diffuse and tinted\nspecular; dielectrics have diffuse and ~4% white specular. ⚠️ **Intermediate metallic\nvalues are physically meaningless and exist only for texture blending at material\nboundaries.**\n\n**IBL (image-based lighting)**: prefiltered environment maps + a split-sum approximation\nBRDF LUT. **Spherical harmonics** for low-frequency irradiance — ⚠️ **9 coefficients\ncapture diffuse environment lighting almost exactly, which is why SH is everywhere.**\n\n---\n\n## §4. Ray Tracing and the Rendering Equation\n\n**Kajiya, 1986** — ⚠️ **the ground truth for all of rendering:**\n```\nL_o(x, ω_o) = L_e(x, ω_o) + ∫_Ω f_r(x, ω_i, ω_o) · L_i(x, ω_i) · (n·ω_i) dω_i\n```\n**Outgoing radiance = emitted + integral over the hemisphere of incoming radiance times\nBRDF times cosine.** ⚠️ **It's recursive — `L_i` is some other surface's `L_o` — which is\nwhy global illumination is expensive and why every real-time technique is an\napproximation of this integral.**\n\n**Monte Carlo estimation**: sample directions, weight by `1\u002Fpdf`. **Variance falls as\n`1\u002F√N`** — ⚠️ **so halving noise costs 4× the samples, which is the fundamental economics\nof path tracing.**\n**Variance reduction**: **importance sampling** (⚠️ **sample proportional to the\nintegrand — the single biggest win**), multiple importance sampling (**MIS** — Veach),\nnext-event estimation, Russian roulette for unbiased termination, and stratification \u002F\nlow-discrepancy sequences.\n\n**Acceleration structures**: **BVH** (⚠️ **the standard; built with SAH — the surface area\nheuristic**), kd-tree, grids. **Ray-triangle intersection**: Möller-Trumbore.\n\n**⚠️ Denoising is now part of the algorithm, not a post-process** — real-time ray tracing\ntraces roughly one sample per pixel and relies on spatiotemporal denoising (SVGF, and ML\ndenoisers like OptiX\u002FOIDN) to be viable at all.\n\n**Hardware ray tracing** (RTX\u002FDXR\u002FVulkan RT) accelerates BVH traversal and intersection.\n⚠️ **It does not make path tracing free — it makes ray *queries* fast, and the sampling\nand denoising budget still dominates.**\n","# Graphics and Vision: Transforms, Rasterization, Shading, and Ray Tracing\n\n> **Part 1 of 5** of the *Graphics and Vision* reference (plugin `graphics-and-vision`), covering §0–§4. Sibling skills: `gfx-gpu-real-time-techniques-and-colour` (§5–§7), `gfx-image-formation-classical-vision-and-geometry` (§8–§10), `gfx-deep-learning-neural-rendering-and-performance` (§11–§13), `gfx-reference` (§14–§19). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The mathematics is permanent — projective geometry, the rendering equation, epipolar geometry. Neural rendering and vision foundation models moved. See §16 → `gfx-reference` for those.\n\n> **Why one document.** ⚠️ **They are inverse problems over the same geometry.** Graphics\n> goes scene → image; vision goes image → scene. **They share the camera model, projective\n> geometry, and increasingly the representations** — §12 → `gfx-deep-learning-neural-rendering-and-performance` is where they now meet directly.\n>\n> **⚠️ GOTCHA** boxes mark where the math is subtle or the standard implementation is\n> silently wrong.\n>\n> **The three ideas that unify the whole document:**\n> 1. **⚠️ Homogeneous coordinates make projection linear.** Adding a fourth component turns\n>    perspective — a nonlinear operation — into a matrix multiply, which is why the entire\n>    pipeline is matrices (§1).\n> 2. **⚠️ Rendering is an integral, and everything real-time is a sampling strategy for\n>    it.** The rendering equation is the ground truth; rasterization, path tracing, and\n>    every approximation in §6 → `gfx-gpu-real-time-techniques-and-colour` are ways of estimating it under a time budget (§4).\n> 3. **⚠️ Vision is underdetermined and that is not a solvable bug.** A single image is a\n>    projection; depth is destroyed. Every vision method is adding a constraint — multiple\n>    views, motion, a learned prior — to recover what the projection threw away (§8 → `gfx-image-formation-classical-vision-and-geometry`, §10 → `gfx-image-formation-classical-vision-and-geometry`).\n\n---\n\n## §0. Routing\n\n| You want... | Go to |\n|---|---|\n| **Transforms and projective geometry** | **§1** |\n| Rasterization pipeline | §2 |\n| **Shading, PBR, the rendering equation** | **§3, §4** |\n| Ray and path tracing | §4 |\n| GPU architecture and APIs | §5 → `gfx-gpu-real-time-techniques-and-colour` |\n| **Real-time techniques** | **§6 → `gfx-gpu-real-time-techniques-and-colour`** |\n| Colour and tone mapping | §7 → `gfx-gpu-real-time-techniques-and-colour` |\n| **Camera model and calibration** | **§8 → `gfx-image-formation-classical-vision-and-geometry`** |\n| Classical CV | §9 → `gfx-image-formation-classical-vision-and-geometry` |\n| **Multiple view geometry, SfM, SLAM** | **§10 → `gfx-image-formation-classical-vision-and-geometry`** |\n| Deep learning for vision | §11 → `gfx-deep-learning-neural-rendering-and-performance` |\n| **Neural rendering (NeRF, 3DGS)** | **§12 → `gfx-deep-learning-neural-rendering-and-performance`** |\n| Performance | §13 → `gfx-deep-learning-neural-rendering-and-performance` |\n| Anti-patterns | §14 → `gfx-reference` |\n| Numbers | §15 → `gfx-reference` |\n| **What actually moved** | **§16 → `gfx-reference`** |\n| Books | §17 → `gfx-reference` |\n| Quick reference | §18 → `gfx-reference` |\n\n---\n\n## §1. Transforms and Projective Geometry\n\n**Homogeneous coordinates**: a 3D point becomes `(x, y, z, w)`, with the Euclidean point\nrecovered as `(x\u002Fw, y\u002Fw, z\u002Fw)`. ⚠️ **`w = 0` denotes a point at infinity — a direction.**\n**This is why you must transform normals and positions differently**: positions are\n`(x,y,z,1)`, directions `(x,y,z,0)`, so translation applies to one and not the other.\n\n**The pipeline of spaces:**\n```\nModel → [model matrix] → World → [view matrix] → View\u002FCamera\n      → [projection] → Clip → [÷w, perspective divide] → NDC\n      → [viewport] → Screen\n```\n**⚠️ The perspective divide is where the nonlinearity enters** — everything before it is\nlinear, which is the entire point of homogeneous coordinates.\n\n**⚠️ Normal transformation is the classic bug**: normals transform by the **inverse\ntranspose** of the model matrix, not the matrix itself. **Under non-uniform scaling, using\nthe model matrix skews normals off the surface and your lighting is wrong** in a way that\nlooks like a shading bug rather than a math bug.\n\n**Rotations**: matrices (composable, 9 numbers, drift under repeated multiplication),\n**Euler angles** (⚠️ **intuitive and gimbal-locked — avoid for interpolation or\naccumulation**), **quaternions** (⚠️ **4 numbers, no gimbal lock, and `slerp` interpolates\ncorrectly — the right internal representation**; note `q` and `−q` are the same rotation,\nwhich trips comparison and naive interpolation), **axis-angle**, and **Lie algebra\n(SO(3)\u002FSE(3))** — ⚠️ **the right formulation for optimization, because it gives you a\nminimal, unconstrained local parameterization**, which is why SLAM and bundle adjustment\nuse it (§10 → `gfx-image-formation-classical-vision-and-geometry`).\n\n**⚠️ Conventions that cause days of confusion**: row-vector vs column-vector, row-major vs\ncolumn-major storage, left- vs right-handed coordinates, and **NDC depth range —\nOpenGL's `[-1,1]` vs D3D\u002FVulkan\u002FMetal's `[0,1]`.** **Write yours down at the top of the\nfile.**\n\n---\n\n## §2. Rasterization\n\n```\nVertex data → vertex shader → [optional tessellation, geometry]\n  → clipping → perspective divide → viewport transform\n    → triangle setup → RASTERIZE → early-Z → fragment shader\n      → depth\u002Fstencil test → blend → framebuffer\n```\n\n**Rasterization** determines coverage: for each pixel, is its centre inside the triangle?\n**Edge functions** (Pineda) give this as three sign tests, and ⚠️ **they're incrementally\nevaluable, which is why hardware does it this way.**\n\n**⚠️ Perspective-correct interpolation is essential and non-obvious**: interpolating an\nattribute linearly in screen space is wrong under perspective. **Interpolate `attr\u002Fw` and\n`1\u002Fw` linearly, then divide.** ⚠️ **Getting this wrong produces the classic warped-texture\nartifact of early 3D hardware.**\n\n**Depth**: the Z-buffer. ⚠️ **Depth precision is non-linearly distributed** — most\nprecision sits near the near plane, so **z-fighting at distance is caused by a near plane\nthat is too close, far more often than by a far plane that is too far.** **Reversed-Z with\na floating-point depth buffer** largely fixes this and is the modern default.\n\n**Culling**: backface (winding order), frustum, occlusion, and **early-Z** — ⚠️ **which is\ndisabled if the fragment shader writes depth or uses `discard`, and that is a common\nsilent performance cliff.**\n\n**Texturing**: UV mapping, filtering (nearest, bilinear, trilinear, **anisotropic**),\n**mipmaps** (⚠️ **not an optimization — they're antialiasing in the texture domain, and\nwithout them minified textures shimmer**), wrap modes, and compressed formats (BC\u002FDXT,\nASTC, ETC).\n\n---\n\n## §3. Shading and PBR\n\n**The BRDF** `f_r(ω_i, ω_o)` describes how light scatters at a surface. ⚠️ **A physically\nvalid BRDF must obey reciprocity (`f_r(ω_i,ω_o) = f_r(ω_o,ω_i)`) and energy conservation\n(it cannot reflect more than it receives).**\n\n**Legacy models**: Lambert diffuse (`n·l`), Phong and Blinn-Phong specular —\n⚠️ **not energy-conserving and not reciprocal, but cheap and still everywhere.**\n\n**Modern microfacet PBR** — the standard, built as `D · F · G \u002F (4 (n·l)(n·v))`:\n- **D — normal distribution function** (⚠️ **GGX\u002FTrowbridge-Reitz won because its long\n  tail matches measured materials far better than Beckmann**).\n- **F — Fresnel** (⚠️ **Schlick's approximation; reflectance rises to 1 at grazing angles\n  for every material, which is the single most important visual cue PBR added**).\n- **G — geometry\u002Fshadowing-masking term** (Smith).\n\n**⚠️ The parameterization that won**: **base colour, metallic, roughness**, plus normal,\nAO, and emissive. **Metallic is a near-binary switch** — metals have no diffuse and tinted\nspecular; dielectrics have diffuse and ~4% white specular. ⚠️ **Intermediate metallic\nvalues are physically meaningless and exist only for texture blending at material\nboundaries.**\n\n**IBL (image-based lighting)**: prefiltered environment maps + a split-sum approximation\nBRDF LUT. **Spherical harmonics** for low-frequency irradiance — ⚠️ **9 coefficients\ncapture diffuse environment lighting almost exactly, which is why SH is everywhere.**\n\n---\n\n## §4. Ray Tracing and the Rendering Equation\n\n**Kajiya, 1986** — ⚠️ **the ground truth for all of rendering:**\n```\nL_o(x, ω_o) = L_e(x, ω_o) + ∫_Ω f_r(x, ω_i, ω_o) · L_i(x, ω_i) · (n·ω_i) dω_i\n```\n**Outgoing radiance = emitted + integral over the hemisphere of incoming radiance times\nBRDF times cosine.** ⚠️ **It's recursive — `L_i` is some other surface's `L_o` — which is\nwhy global illumination is expensive and why every real-time technique is an\napproximation of this integral.**\n\n**Monte Carlo estimation**: sample directions, weight by `1\u002Fpdf`. **Variance falls as\n`1\u002F√N`** — ⚠️ **so halving noise costs 4× the samples, which is the fundamental economics\nof path tracing.**\n**Variance reduction**: **importance sampling** (⚠️ **sample proportional to the\nintegrand — the single biggest win**), multiple importance sampling (**MIS** — Veach),\nnext-event estimation, Russian roulette for unbiased termination, and stratification \u002F\nlow-discrepancy sequences.\n\n**Acceleration structures**: **BVH** (⚠️ **the standard; built with SAH — the surface area\nheuristic**), kd-tree, grids. **Ray-triangle intersection**: Möller-Trumbore.\n\n**⚠️ Denoising is now part of the algorithm, not a post-process** — real-time ray tracing\ntraces roughly one sample per pixel and relies on spatiotemporal denoising (SVGF, and ML\ndenoisers like OptiX\u002FOIDN) to be viable at all.\n\n**Hardware ray tracing** (RTX\u002FDXR\u002FVulkan RT) accelerates BVH traversal and intersection.\n⚠️ **It does not make path tracing free — it makes ray *queries* fast, and the sampling\nand denoising budget still dominates.**\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fgraphics-and-vision\u002Fskills\u002Fgfx-transforms-rasterization-and-rendering",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill gfx-transforms-rasterization-and-rendering",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill gfx-transforms-rasterization-and-rendering",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill gfx-transforms-rasterization-and-rendering","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fgraphics-and-vision\u002Fskills\u002Fgfx-transforms-rasterization-and-rendering\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]