[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M77SS9DFN3VAFQX5XH7D6P7F":3,"skill-same:01M77SS9DFN3VAFQX5XH7D6P7F":49},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":29,"commitSha":30,"skillDirectory":31,"forksCount":13,"repositoryHtmlUrl":32,"repositoryHomepageUrl":6,"ownerHtmlUrl":33,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":34,"install":35,"resources":48},"01M77SS9DFN3VAFQX5XH7D6P7F","game-spatial-queries",null,"Design and review game spatial query code for raycasts, picking, collision predicates, containment tests, orientation tests, and point\u002Fline\u002Fplane distances. Use when implementing or debugging ray-triangle hits, point-in-triangle checks, barycentric constraints, signed distance tests, or geometry predicates.","ConcertoNotes\u002Fcodex-plugins","ConcertoNotes","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F249301288?v=4","01M77NJ0BK2KN5YW0D8RHD99TB","01M77NJ0CCEDPATAY3JTXEWNK5",0,"MIT","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fcommunity\u002Flvtd-skills\u002Fskills\u002Fgame-spatial-queries\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: game-spatial-queries\ndescription: Design and review game spatial query code for raycasts, picking, collision predicates, containment tests, orientation tests, and point\u002Fline\u002Fplane distances. Use when implementing or debugging ray-triangle hits, point-in-triangle checks, barycentric constraints, signed distance tests, or geometry predicates.\nlicense: MIT\ncompatibility: Codex, Claude Code, and other Agent Skills-compatible clients.\nmetadata:\n  version: \"0.1.0\"\n  displayName: Game Spatial Queries\n  category: Game Development\n  tags: game-dev,game-geometry,collision,raycasting,spatial-queries\n---\n\n# Game Spatial Queries\n\nUse this skill to turn game picking, collision, containment, and distance\nquestions into small geometric systems with explicit constraints and failure\ncases.\n\nPrimary source: Geometry for Programmers by Oleksandr Kaleniuk\n(https:\u002F\u002Fwww.manning.com\u002Fbooks\u002Fgeometry-for-programmers), transformed and\nparaphrased, especially chapters 3, 4, and 9. Additional source: \"Fast,\nMinimum Storage Ray-Triangle Intersection\" by Tomas Moller and Ben Trumbore\n(https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1198555.1198746).\n\n## Core Workflow\n\n1. State the query as a predicate or measured value: hit\u002Fmiss, inside\u002Foutside,\n   closest distance, signed side, intersection point, or parameter value.\n2. Move into the simplest local basis when possible. Triangle, segment, plane,\n   and object-local bases often reduce the query to bounds checks.\n3. Derive parameters first, then apply constraints. Keep constraints visible in\n   code instead of burying them in one large expression.\n4. Identify denominator, orientation, or length values that signal degeneracy.\n5. Choose a numeric policy: exact integer predicate, scale-aware epsilon,\n   inclusive boundary, exclusive boundary, or conservative fallback.\n6. Test hit, miss, boundary, parallel, degenerate, and near-degenerate cases.\n7. Add a debug visualization when the query affects gameplay feel.\n\n## Query Patterns\n\n### Ray Against Triangle\n\nModel the ray as `R = P + t*d` with `t >= 0`. Model triangle points as\n`S = A + u*AB + v*AC` with `u >= 0`, `v >= 0`, and `u + v \u003C= 1`.\n\nSolve `R = S`, then:\n\n- Reject when the shared denominator is zero or too small for the numeric policy.\n- Reject when `t \u003C 0`.\n- Reject when `u \u003C 0`, `v \u003C 0`, or `u + v > 1`.\n- Return hit distance `t`, barycentric-like parameters `u` and `v`, and the hit\n  point when needed.\n\n### Point In Triangle\n\nPrefer one of these approaches:\n\n- Transform the triangle to its local basis and check `0 \u003C= u`, `0 \u003C= v`,\n  `u + v \u003C= 1`.\n- Use consistent edge orientation signs from 2D cross products.\n- Use barycentric coordinates when the caller needs interpolation weights too.\n\nDecide whether points on edges count as inside. Tests must cover both the chosen\nedge policy and reversed triangle winding.\n\n### Signed Point To Plane\n\nBuild a plane normal from two nonparallel edges. Dot the normalized normal with\nthe vector from any plane point to the query point. Keep the sign when side\nmatters; take absolute value only for unsigned distance.\n\n### Segment And Closest-Point Queries\n\nProject onto the segment direction, clamp the parameter to `[0, 1]`, then measure\ndistance to the clamped point. Reject or special-case zero-length segments before\nnormalization.\n\n## Degenerate Geometry Policy\n\n- Zero-length vectors must not be normalized.\n- Degenerate triangles must not create unstable bases or normals.\n- Parallel ray\u002Fplane cases need a deliberate answer: no hit, coplanar handling,\n  or fallback query.\n- Very small denominators need a scale-aware policy. A fixed epsilon is often\n  wrong across different world scales.\n- Boundary inclusion must match gameplay: selection tools often want inclusive\n  checks; collision separation often wants conservative checks.\n\n## Implementation Checklist\n\n- Function name states geometry and boundary policy.\n- Inputs document coordinate space and units.\n- Winding assumptions are explicit.\n- Denominator and zero-length cases are handled before division.\n- Return type exposes enough detail for the caller: bool, distance, hit point,\n  normal, barycentric weights, or rejection reason.\n- Tests include normal case, miss case, edge\u002Fvertex case, reversed winding,\n  parallel case, degenerate case, and large\u002Fsmall scale case.\n\n## Common Mistakes\n\n- Computing a global-space query when object-local coordinates make it trivial.\n- Returning only `bool` from a query that later needs hit distance or normal.\n- Comparing floats to zero with no policy.\n- Forgetting that normals and barycentric coordinates depend on winding.\n- Treating \"not hit\" and \"invalid input geometry\" as the same debugging signal.\n","# Game Spatial Queries\n\nUse this skill to turn game picking, collision, containment, and distance\nquestions into small geometric systems with explicit constraints and failure\ncases.\n\nPrimary source: Geometry for Programmers by Oleksandr Kaleniuk\n(https:\u002F\u002Fwww.manning.com\u002Fbooks\u002Fgeometry-for-programmers), transformed and\nparaphrased, especially chapters 3, 4, and 9. Additional source: \"Fast,\nMinimum Storage Ray-Triangle Intersection\" by Tomas Moller and Ben Trumbore\n(https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1198555.1198746).\n\n## Core Workflow\n\n1. State the query as a predicate or measured value: hit\u002Fmiss, inside\u002Foutside,\n   closest distance, signed side, intersection point, or parameter value.\n2. Move into the simplest local basis when possible. Triangle, segment, plane,\n   and object-local bases often reduce the query to bounds checks.\n3. Derive parameters first, then apply constraints. Keep constraints visible in\n   code instead of burying them in one large expression.\n4. Identify denominator, orientation, or length values that signal degeneracy.\n5. Choose a numeric policy: exact integer predicate, scale-aware epsilon,\n   inclusive boundary, exclusive boundary, or conservative fallback.\n6. Test hit, miss, boundary, parallel, degenerate, and near-degenerate cases.\n7. Add a debug visualization when the query affects gameplay feel.\n\n## Query Patterns\n\n### Ray Against Triangle\n\nModel the ray as `R = P + t*d` with `t >= 0`. Model triangle points as\n`S = A + u*AB + v*AC` with `u >= 0`, `v >= 0`, and `u + v \u003C= 1`.\n\nSolve `R = S`, then:\n\n- Reject when the shared denominator is zero or too small for the numeric policy.\n- Reject when `t \u003C 0`.\n- Reject when `u \u003C 0`, `v \u003C 0`, or `u + v > 1`.\n- Return hit distance `t`, barycentric-like parameters `u` and `v`, and the hit\n  point when needed.\n\n### Point In Triangle\n\nPrefer one of these approaches:\n\n- Transform the triangle to its local basis and check `0 \u003C= u`, `0 \u003C= v`,\n  `u + v \u003C= 1`.\n- Use consistent edge orientation signs from 2D cross products.\n- Use barycentric coordinates when the caller needs interpolation weights too.\n\nDecide whether points on edges count as inside. Tests must cover both the chosen\nedge policy and reversed triangle winding.\n\n### Signed Point To Plane\n\nBuild a plane normal from two nonparallel edges. Dot the normalized normal with\nthe vector from any plane point to the query point. Keep the sign when side\nmatters; take absolute value only for unsigned distance.\n\n### Segment And Closest-Point Queries\n\nProject onto the segment direction, clamp the parameter to `[0, 1]`, then measure\ndistance to the clamped point. Reject or special-case zero-length segments before\nnormalization.\n\n## Degenerate Geometry Policy\n\n- Zero-length vectors must not be normalized.\n- Degenerate triangles must not create unstable bases or normals.\n- Parallel ray\u002Fplane cases need a deliberate answer: no hit, coplanar handling,\n  or fallback query.\n- Very small denominators need a scale-aware policy. A fixed epsilon is often\n  wrong across different world scales.\n- Boundary inclusion must match gameplay: selection tools often want inclusive\n  checks; collision separation often wants conservative checks.\n\n## Implementation Checklist\n\n- Function name states geometry and boundary policy.\n- Inputs document coordinate space and units.\n- Winding assumptions are explicit.\n- Denominator and zero-length cases are handled before division.\n- Return type exposes enough detail for the caller: bool, distance, hit point,\n  normal, barycentric weights, or rejection reason.\n- Tests include normal case, miss case, edge\u002Fvertex case, reversed winding,\n  parallel case, degenerate case, and large\u002Fsmall scale case.\n\n## Common Mistakes\n\n- Computing a global-space query when object-local coordinates make it trivial.\n- Returning only `bool` from a query that later needs hit distance or normal.\n- Comparing floats to zero with no policy.\n- Forgetting that normals and barycentric coordinates depend on winding.\n- Treating \"not hit\" and \"invalid input geometry\" as the same debugging signal.\n",{"name":5,"license":14,"metadata":23,"description":7,"compatibility":28},{"tags":24,"version":25,"category":26,"displayName":27},"game-dev,game-geometry,collision,raycasting,spatial-queries","0.1.0","Game Development","Game Spatial Queries","Codex, Claude Code, and other Agent Skills-compatible clients.","main","9ba3c9fadff1092395837bf1502e1b8a7f98b1e1","plugins\u002Fcommunity\u002Flvtd-skills\u002Fskills\u002Fgame-spatial-queries","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins","https:\u002F\u002Fgithub.com\u002FConcertoNotes","2026-06-26 10:13:54",{"source":8,"skillName":5,"commands":36,"prompt":46,"zipAvailable":47},[37,40,43],{"tool":38,"command":39},"npx","npx skills add ConcertoNotes\u002Fcodex-plugins --skill game-spatial-queries",{"tool":41,"command":42},"bunx","bunx skills add ConcertoNotes\u002Fcodex-plugins --skill game-spatial-queries",{"tool":44,"command":45},"pnpm","pnpm dlx skills add ConcertoNotes\u002Fcodex-plugins --skill game-spatial-queries","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fcommunity\u002Flvtd-skills\u002Fskills\u002Fgame-spatial-queries\u002FSKILL.md",true,[],[50,59,66,74,81,88],{"skillNo":51,"name":52,"nameZh":6,"description":53,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":54,"licenseFileUrl":55,"sourceHtmlUrl":56,"categories":57,"keywords":58,"publishedAt":18},"01M77YB7WW36DS9AERTWP673E0","android-emulator-qa","Use when validating Android feature flows in an emulator with adb-driven launch, input, UI-tree inspection, screenshots, and logcat capture.","Apache-2.0","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Ftest-android-apps\u002Fskills\u002Fandroid-emulator-qa\u002FLICENSE.txt","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Ftest-android-apps\u002Fskills\u002Fandroid-emulator-qa\u002FSKILL.md",[],[],{"skillNo":60,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":63,"categories":64,"keywords":65,"publishedAt":18},"01M77Y7AA8N45G6NM0WJSS2W9C","supabase-postgres-best-practices","Postgres performance optimization and best practices from Supabase. Use this skill when writing, reviewing, or optimizing Postgres queries, schema designs, or database configurations.","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Fsupabase\u002Fskills\u002Fsupabase-postgres-best-practices\u002FSKILL.md",[],[],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":54,"licenseFileUrl":70,"sourceHtmlUrl":71,"categories":72,"keywords":73,"publishedAt":18},"01M77Y2W5H5YGSW7MYWEJ8HYXD","sentry","Use when the user asks to inspect Sentry issues or events, summarize recent production errors, or pull basic Sentry health data via the Sentry API; perform read-only queries with the bundled script and require `SENTRY_AUTH_TOKEN`.","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Fsentry\u002Fskills\u002Fsentry\u002FLICENSE.txt","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Fsentry\u002Fskills\u002Fsentry\u002FSKILL.md",[],[],{"skillNo":75,"name":76,"nameZh":6,"description":77,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":78,"categories":79,"keywords":80,"publishedAt":18},"01M77Y06GV1DAME7PN9KBFHWRX","render-workflows","Sets up, develops, tests, and deploys Render Workflows. Covers first-time scaffolding (via CLI or manual), SDK installation (Python or TypeScript), task patterns (retries, subtasks, fan-out), local development, Dashboard deployment, and troubleshooting. Use when a user wants to set up Render Workflows for the first time, scaffold a workflow service, add or modify workflow tasks, test workflows locally, or deploy workflows to Render.","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Frender\u002Fskills\u002Frender-workflows\u002FSKILL.md",[],[],{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":18},"01M77Y01A6RJA8VYT7CZ2TVETF","render-web-services","Configures Render web services—port binding, TLS, health checks, custom domains, auto-deploy, PR previews, persistent disks, and deploy lifecycle. Use when the user needs to set up a web service, fix health check failures, add a custom domain, configure zero-downtime deploys, or troubleshoot port binding issues.","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Frender\u002Fskills\u002Frender-web-services\u002FSKILL.md",[],[],{"skillNo":89,"name":90,"nameZh":6,"description":91,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":92,"categories":93,"keywords":94,"publishedAt":18},"01M77XZW1AZ6B6NZTWWFVY72T3","render-static-sites","Deploys and configures static sites on Render's global CDN—build commands, publish paths, SPA routing, redirects, custom headers, and PR previews. Use when the user needs to deploy a static site, set up a React\u002FVue\u002FHugo\u002FGatsby frontend, configure SPA fallback routing, add redirect rules, customize response headers, or choose between a static site and a web service for their frontend. Trigger terms: static site, CDN, SPA, single-page app, React deploy, Vue deploy, Hugo, Gatsby, Docusaurus, Jekyll, staticPublishPath.","https:\u002F\u002Fgithub.com\u002FConcertoNotes\u002Fcodex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fofficial\u002Frender\u002Fskills\u002Frender-static-sites\u002FSKILL.md",[],[]]