Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add nezolder/civil3d-mcp-roslyn --skill bounded_volumesgit clone --depth 1 https://github.com/nezolder/civil3d-mcp-roslynWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/nezolder/civil3d-mcp-roslyn/bounded_volumes)<a href="https://agentmods.dev/skills/nezolder/civil3d-mcp-roslyn/bounded_volumes"><img src="https://agentmods.dev/badge/skills/nezolder/civil3d-mcp-roslyn/bounded_volumes/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/nezolder/civil3d-mcp-roslyn/bounded_volumes"><img src="https://agentmods.dev/badge/skills/nezolder/civil3d-mcp-roslyn/bounded_volumes.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00030 | $0.02166 |
| Opus 5.5 | $0.00012 | $0.00866 |
| Sonnet 5.5 | $0.00006 | $0.00433 |
| Haiku 4.5 | $0.00003 | $0.00217 |
Grade A, and why
bounded_volumes scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 19d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 203 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Code Template
var volumeSurfaceHandle = "VOLUME_SURFACE_HANDLE";
var boundaries = new (string handle, string label)[] { };
var arcSegments = 64;
var isHandle = new Func<string, bool>(value =>
!string.IsNullOrWhiteSpace(value)
&& System.Text.RegularExpressions.Regex.IsMatch(value, "^[0-9A-Fa-f]{1,16}$"));
if (!isHandle(volumeSurfaceHandle))
{
return new { success = false, error = "volumeSurfaceHandle must be a hexadecimal handle." };
}
if (boundaries == null || boundaries.Length < 1 || boundaries.Length > 200
|| boundaries.Any(b => !isHandle(b.handle) || b.label == null || b.label.Length > 255)
|| boundaries.Select(b => b.handle.ToUpperInvariant()).Distinct().Count() != boundaries.Length)
{
return new { success = false, error = "Supply 1..200 boundaries with distinct hexadecimal handles and labels of at most 255 characters." };
}
if (arcSegments < 4 || arcSegments > 256)
{
return new { success = false, error = "arcSegments must be 4..256." };
}
ObjectId? ResolveId(string handle)
{
try { return Database.GetObjectId(false, new Handle(System.Convert.ToInt64(handle, 16)), 0); }
catch { return null; }
}
var volumeSurfaceId = ResolveId(volumeSurfaceHandle);
var volumeSurface = volumeSurfaceId.HasValue
? Transaction.GetObject(volumeSurfaceId.Value, OpenMode.ForRead) as TinVolumeSurface
: null;
if (volumeSurface == null || volumeSurface.IsErased)
{
return new { success = false, error = "volumeSurfaceHandle must identify an existing TIN volume surface.", volumeSurfaceHandle };
}
// Plan polygon of a closed boundary, closed by repeating the first point.
// Polyline arc segments are replaced by arcSegments chords.
(List<Point3d> points, string error) Polygon(ObjectId id)
{
var entity = Transaction.GetObject(id, OpenMode.ForRead);
var points = new List<Point3d>();
if (entity is Polyline polyline)
{
if (!polyline.Closed) return (null, "Polyline is not closed.");
for (var i = 0; i < polyline.NumberOfVertices; i++)
{
var vertex = polyline.GetPoint2dAt(i);
points.Add(new Point3d(vertex.X, vertex.Y, 0));
if (Math.Abs(polyline.GetBulgeAt(i)) > 1e-12)
{
for (var k = 1; k < arcSegments; k++)
{
var p = polyline.GetPointAtParameter(i + (double)k / arcSegments);
points.Add(new Point3d(p.X, p.Y, 0));
}
}
}
}
else if (entity is Polyline3d polyline3d)
{
if (!polyline3d.Closed) return (null, "Polyline3d is not closed.");
foreach (ObjectId vertexId in polyline3d)
{
var vertex = (PolylineVertex3d)Transaction.GetObject(vertexId, OpenMode.ForRead);
points.Add(new Point3d(vertex.Position.X, vertex.Position.Y, 0));
}
}
else
{
return (null, $"Unsupported boundary type {entity.GetType().Name}; use a closed Polyline or Polyline3d.");
}
// Drop a repeated closing vertex, then require a real area.
if (points.Count > 1 && points[0].DistanceTo(points[points.Count - 1]) < 1e-9) points.RemoveAt(points.Count - 1);
if (points.Count < 3) return (null, "Boundary needs at least 3 distinct vertices.");
points.Add(points[0]);
return (points, null);
}
// Shoelace area relative to the first vertex, so large drawing coordinates
// do not cancel out.
double BoundaryArea(List<Point3d> closed)
{
var origin = closed[0];
var twice = 0.0;
for (var i = 1; i < closed.Count - 2; i++)
{
twice += (closed[i].X - origin.X) * (closed[i + 1].Y - origin.Y)
- (closed[i + 1].X - origin.X) * (closed[i].Y - origin.Y);
}
return Math.Abs(twice) / 2;
}
var cutFactor = volumeSurface.CutFactor;
var fillFactor = volumeSurface.FillFactor;
var rows = new List<object>();
double totalCut = 0, totalFill = 0;
var measured = 0;
foreach (var boundary in boundaries)
{
var id = ResolveId(boundary.handle);
if (!id.HasValue)
{
rows.Add(new { boundary.label, boundary.handle, error = "Handle does not resolve to an object in this drawing." });
continue;
}
var (polygon, polygonError) = Polygon(id.Value);
if (polygonError != null)
{
rows.Add(new { boundary.label, boundary.handle, error = polygonError });
continue;
}
try
{
var collection = new Point3dCollection(polygon.ToArray());
var info = volumeSurface.GetBoundedVolumes(collection);
rows.Add(new {
boundary.label,
boundary.handle,
boundaryArea = BoundaryArea(polygon),
vertexCount = polygon.Count - 1,
cut = info.Cut,
fill = info.Fill,
net = info.Net,
adjustedCut = info.Cut * cutFactor,
adjustedFill = info.Fill * fillFactor,
adjustedNet = info.Fill * fillFactor - info.Cut * cutFactor
});
totalCut += info.Cut;
totalFill += info.Fill;
measured++;
}
catch (System.Exception ex)
{
rows.Add(new { boundary.label, boundary.handle, error = $"{ex.GetType().Name}: {ex.Message}" });
}
}
return new {
success = measured > 0,
volumeSurface = new {
name = volumeSurface.Name,
handle = volumeSurface.Handle.ToString(),
isOutOfDate = volumeSurface.IsOutOfDate,
cutFactor,
fillFactor
},
measured,
failed = boundaries.Length - measured,
totals = new {
cut = totalCut,
fill = totalFill,
net = totalFill - totalCut,
adjustedCut = totalCut * cutFactor,
adjustedFill = totalFill * fillFactor,
adjustedNet = totalFill * fillFactor - totalCut * cutFactor
},
boundaries = rows
};
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 19d ago First seen · 203 lines · 30 tokens per session scan A 417e4cd01368
bounded_volumes is a skill published in the GitHub repository nezolder/civil3d-mcp-roslyn (3 stars, last pushed 16d ago), licensed MIT. It adds 30 tokens to every session and 2,166 once invoked, about $0.0001 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-10-09.
Other skills, from other repositories
computational-geometry
NURBS curves and surfaces, mesh geometry, boolean operations, subdivision surfaces, tessellation methods, surface analysis, and point cloud processing for AEC computational design.
computational-geometry
NURBS curves and surfaces, mesh geometry, boolean operations, subdivision surfaces, tessellation methods, surface analysis, and point cloud processing for AEC computational design.
internal-docs-operator
Use when working against the internal documentation surfaces on :4401 and :4400, especially for target-specific doc updates, source-of-truth checks, verification of live state, and preventing false completion claims.
local-ai-agents
Build local-first AI agents that run entirely on a developer workstation with Microsoft Foundry Local and Qwen function-calling models. Covers Small Language Models (SLMs), the OpenAI-compatible local endpoint, sandboxed local tools, local RAG with Chroma, local MCP servers, hybrid cloud/local routing, and the…
systematic-debugging
Use when encountering any bug, test failure, or unexpected behavior, before proposing fixes.
next-cache-components-adoption
Turn on Cache Components in a Next.js app and resolve the blocking routes it surfaces. Use when the user wants to enable, adopt, or migrate to Cache Components, flip the cacheComponents flag, work through a flood of blocking-prerender / instant validation errors, run the cache-components-instant-false codemod, or…