About slvsx-server
slvsx-server is an MCP server published by git+snoble in the Maps category: mCP server for SLVSX geometric constraint solver. It has been installed 0 times through Conduid.
Install
npx @sknoble/slvsx-mcp-serverclaude mcp add slvsx-cli -- npx -y @sknoble/slvsx-mcp-servernpx -y @sknoble/slvsx-mcp-serverThis server has no ConduID identity, so agent calls to it are not receipted. Pin the version you install and review the source before granting it credentials.
Ask AI
Ask AI about slvsx-server
Powered by Claude · Grounded in docs
Security checks
- ·README presentNot checked yet.
- ·License declaredNot checked yet.
- ·Tests presentNot checked yet.
- ·Dependencies pinnedNot checked yet.
- ·No dynamic code executionNot checked yet.
- !Scoped permissionsDoesn't declare a permission scope. Assume it can do anything its process can.
README
SLVSX - SolveSpace Constraint Solver CLI
A command-line tool that makes the SolveSpace geometric constraint solver accessible to AI agents and developers through a simple JSON interface.
Features
- 🤖 AI-Ready - Designed for use by AI agents through subprocess calls
- 📦 Static Binary - Single executable with no dependencies
- 🔧 JSON Interface - Simple input/output format
- 🎯 Constraint Solving - Points, lines, circles, distances, angles, and more
- 📐 Export Formats - SVG, DXF, STL output
- 🚀 Fast - Native C++ solver wrapped in Rust
Installation
Download Static Binary (Recommended)
# Linux (x86_64)
curl -L https://github.com/snoble/slvsx-cli/releases/latest/download/slvsx-linux.tar.gz | tar xz
sudo mv slvsx /usr/local/bin/
# macOS (Apple Silicon)
curl -L https://github.com/snoble/slvsx-cli/releases/latest/download/slvsx-macos-arm64.tar.gz | tar xz
sudo mv slvsx /usr/local/bin/
# macOS (Intel)
curl -L https://github.com/snoble/slvsx-cli/releases/latest/download/slvsx-macos-x86_64.tar.gz | tar xz
sudo mv slvsx /usr/local/bin/
# Test installation
slvsx --version
Build from Source
See docs/BUILDING.md for detailed build instructions.
Quick Start
Try It Now
# Solve a triangle from distances
slvsx solve examples/02_triangle.json
# Create a parametric hinge mechanism
slvsx solve examples/08_angles.json
# Design a symmetric arrowhead
slvsx solve examples/11_symmetric.json
# Export to SVG for visualization
slvsx export -f svg examples/08_angles.json -o output.svg
# Export 3D objects from multiple angles
slvsx export -f svg -v xy examples/04_3d_tetrahedron.json -o top.svg
slvsx export -f svg -v xz examples/04_3d_tetrahedron.json -o front.svg
slvsx export -f svg -v yz examples/04_3d_tetrahedron.json -o side.svg
🎨 See the Visual Gallery for cool renders and 3D visualizations!
Basic Example: Triangle from Distances
# Create a simple constraint problem
cat > triangle.json << 'EOF'
{
"schema": "slvs-json/1",
"units": "mm",
"entities": [
{"type": "point", "id": "A", "at": [0, 0, 0]},
{"type": "point", "id": "B", "at": [100, 0, 0]},
{"type": "point", "id": "C", "at": [50, 50, 0]}
],
"constraints": [
{"type": "fixed", "entity": "A"},
{"type": "fixed", "entity": "B"},
{"type": "distance", "between": ["A", "C"], "value": 80},
{"type": "distance", "between": ["B", "C"], "value": 60}
]
}
EOF
# Solve it
slvsx solve triangle.json
# Export to SVG
slvsx export -f svg triangle.json > triangle.svg
What this does: Given two fixed points and distances to a third point, SLVSX calculates where the third point must be. This is triangulation - the same math used in GPS!
See SHOWCASE.md for impressive examples, docs/AI_GUIDE.md for AI agent usage, and docs/ITERATIVE_DESIGN.md for best practices on building constraint problems iteratively.
Commands
slvsx solve input.json # Solve constraints
slvsx validate input.json # Check validity
slvsx export -f svg input.json # Export to SVG
Use from Python
import json, subprocess
def solve(problem):
result = subprocess.run(
['slvsx', 'solve', '-'],
input=json.dumps(problem),
capture_output=True,
text=True
)
return json.loads(result.stdout) if result.returncode == 0 else None
For AI Agents
SLVSX is designed to be used by AI agents for solving geometric constraint problems. Perfect for:
- Constraint-based design generation - Describe what you want, not how to draw it
- Mechanism validation - Check if designs are physically possible
- Parametric optimization - Explore design spaces systematically
- Mathematical precision - Get exact solutions, not approximations
Quick Links:
- AI Agent Guide - Complete guide for AI usage
- Showcase - Impressive examples and use cases
- MCP Integration Guide - Use with Claude Desktop
- AI Examples - Ready-to-use constraint problems
Examples
The examples/ directory contains many constraint problems:
🎯 Quick Wins
- Triangle Solver - Triangulation from distances
- Angle Hinge - Parametric hinge mechanism
- Symmetric Arrow - Symmetry constraints
🔧 Real-World Applications
- Four-Bar Linkage - Classic kinematic mechanism
- Planetary Gears - Gear train positioning
- 3D Tetrahedron - Three-dimensional geometry
📚 Learning Path
- Tutorial Series - Step-by-step learning guide
- Constraint Reference - Detailed constraint examples
See SHOWCASE.md for more impressive examples and use cases!
Documentation
Getting Started
- Showcase - What can you build? Impressive examples
- Visual Gallery - 🎨 Cool renders and visualizations
- AI Agent Guide - Complete guide for AI usage
- Examples Tutorial - Step-by-step learning
Reference
For AI Agents
- AI Guide - Patterns, examples, best practices
- MCP Integration - Use with Claude Desktop
- AI Examples - Ready-to-use problems
License
GPLv3 - See LICENSE file for details.
Built on top of SolveSpace's constraint solver library.
README mirrored from the source repository 3 months ago. The original is authoritative.