[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6MC9ZCT3PZ44XYYS1Y1Q833":3,"skill-same:01M6MC9ZCT3PZ44XYYS1Y1Q833":81},{"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":23,"publishedAt":46,"linkOnly":47,"markdownContent":48,"markdownBody":49,"frontMatter":50,"refName":57,"commitSha":58,"skillDirectory":59,"forksCount":60,"repositoryHtmlUrl":61,"repositoryHomepageUrl":62,"ownerHtmlUrl":63,"ownerBlogUrl":64,"ownerDescription":65,"updatedAt":66,"install":67,"resources":80},"01M6MC9ZCT3PZ44XYYS1Y1Q833","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.","hashgraph-online\u002Fawesome-codex-plugins","hashgraph-online","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F160371962?v=4","01M6CNB6NRJVNNGN14TR01Q6D3","HOL (Hashgraph Online)","01M6JT1HSKKG9V68KQAQGBA7XP",1575,"MIT","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002FLVTD-LLC\u002Fskills\u002Fskills\u002Fgame-spatial-queries\u002FSKILL.md",[18],{"categoryNo":19,"categoryName":20,"taxonomyType":21,"taxonomyTypeDesc":22},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45],"game spatial queries","game","Spatial","queries","query","when","point","orientation","for","implementing","plane","line","tests","geometry","design","use","game development","dev","code","development","debugging","review","2026-11-10 10:12:30",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":15,"metadata":51,"description":7,"compatibility":56},{"tags":52,"version":53,"category":54,"displayName":55},"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","2b63f856ce19c2a797929cacabd9e0fc936812fa","plugins\u002FLVTD-LLC\u002Fskills\u002Fskills\u002Fgame-spatial-queries",491,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins","https:\u002F\u002Fhol.org\u002Fplugins\u002Fbest-codex-plugins","https:\u002F\u002Fgithub.com\u002Fhashgraph-online","https:\u002F\u002Fhol.org","Open-source standards and developer tools for interoperable AI agents: discovery, identity, communication, payments, privacy and security.","2026-11-14 14:06:13",{"source":8,"skillName":5,"commands":68,"prompt":78,"zipAvailable":79},[69,72,75],{"tool":70,"command":71},"npx","npx skills add hashgraph-online\u002Fawesome-codex-plugins --skill game-spatial-queries",{"tool":73,"command":74},"bunx","bunx skills add hashgraph-online\u002Fawesome-codex-plugins --skill game-spatial-queries",{"tool":76,"command":77},"pnpm","pnpm dlx skills add hashgraph-online\u002Fawesome-codex-plugins --skill game-spatial-queries","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002FLVTD-LLC\u002Fskills\u002Fskills\u002Fgame-spatial-queries\u002FSKILL.md",true,[],[82,91,99,107,115,123],{"skillNo":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":86,"sourceHtmlUrl":87,"categories":88,"keywords":89,"publishedAt":90},"01M7DV332YQMGD8WTRJ9DZQXTB","worktable-review-with-annotations","Create, inspect, reply to, update, or resolve situated Worktable annotations. Use when feedback belongs to a Doc section, block, text range, or HTML Doc, or when the user asks to address existing review feedback and coordinate a requested artifact edit.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-review-with-annotations\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-review-with-annotations\u002FSKILL.md",[],[],"2026-11-15 14:19:17",{"skillNo":92,"name":93,"nameZh":6,"description":94,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":95,"sourceHtmlUrl":96,"categories":97,"keywords":98,"publishedAt":90},"01M7DV2YGHCZVBEB1AHYB6CGHE","worktable-find-and-synthesize-context","Find, assess, and synthesize context from Worktable Docs and Records. Use when the user asks what a workspace contains, wants workspace-backed research, needs current facts reconciled across artifacts, or requests a cited synthesis without changing workspace state.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-find-and-synthesize-context\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-find-and-synthesize-context\u002FSKILL.md",[],[],{"skillNo":100,"name":101,"nameZh":6,"description":102,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":103,"sourceHtmlUrl":104,"categories":105,"keywords":106,"publishedAt":90},"01M7DV2TQN1H11ME2SAF9MXN7V","worktable-create-or-update-docs","Create, edit, rename, or maintain narrative Worktable Docs. Use for plans, decisions, briefs, notes, research syntheses, and other durable prose when the user requests a new artifact or a safe update to an existing one.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-update-docs\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-update-docs\u002FSKILL.md",[],[],{"skillNo":108,"name":109,"nameZh":6,"description":110,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":111,"sourceHtmlUrl":112,"categories":113,"keywords":114,"publishedAt":90},"01M7DV2NE452NEA8TXATKSNAJH","worktable-create-or-manage-records","Organize repeated structured information as durable Worktable Records. Use for research datasets, inventories, directories, pipelines, trackers, and other collections whose items need identity, fields, filtering, links, validation, or individual updates.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-records\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-records\u002FSKILL.md",[],[],{"skillNo":116,"name":117,"nameZh":6,"description":118,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":119,"sourceHtmlUrl":120,"categories":121,"keywords":122,"publishedAt":90},"01M7DV2HENRBR2KSCVM064WH0Y","worktable-create-or-manage-interactive-html","Create or improve durable visual and interactive artifacts in Worktable. Use for dashboards, trackers, calculators, mini apps, slide presentations, and other requests that benefit from a polished HTML Doc.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-interactive-html\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-interactive-html\u002FSKILL.md",[],[],{"skillNo":124,"name":125,"nameZh":6,"description":126,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":127,"sourceHtmlUrl":128,"categories":129,"keywords":130,"publishedAt":90},"01M7DV2CADR5R7RQFFYPNAGR9Y","worktable-collaborate-threads","Read, answer, and hand off messages through durable Worktable threads with users or other authenticated participants. Use when the user asks to check addressed messages, reply to a participant, continue a thread, request another agent's help, wait briefly for a response, or watch for comments and messages sent to the agent.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-collaborate-threads\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-collaborate-threads\u002FSKILL.md",[],[]]