geometry-expert

Design and validate computational geometry algorithms for convex hulls and triangulations.

2|1|Updated Feb 20, 2026

Search Tags:#robustness #numerics #algorithm design #computational geometry #algorithm validation

Ready to run

npx skills add https://github.com/vosslab/vosslab-skills --skill geometry-expert

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: geometry-expert
Source: https://github.com/vosslab/vosslab-skills/tree/main/skills/geometry-expert
Command: npx skills add https://github.com/vosslab/vosslab-skills --skill geometry-expert

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill aids in the design, implementation, debugging, and review of computational geometry algorithms, ensuring robustness and correctness in geometric computations.

Core Features & Use Cases

Algorithm Design: Offers guidelines for choosing algorithms based on geometric tasks.
Robustness and Numerics: Provides robust predicate design and handling of numerical issues.
Testing and Oracles: Assists in building test corpora and validating algorithms against oracles.
Use Case: When working on a project involving computational geometry, use this Skill to design a geometric contract, implement an algorithm, and validate it against a trusted library.

Quick Start

Use the geometry-expert skill to design a computational geometry algorithm for finding the convex hull of a set of points.

Frequently Asked Questions about geometry-expert

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I handle numerical robustness and degeneracies in computational geometry algorithms?▼

Numerical robustness in computational geometry algorithms is handled by designing robust predicates and applying precise numerical computations to prevent failures caused by degeneracies. This ensures correct calculations for edge cases like collinear points or overlapping polygons.

What is the best way to design a robust convex hull algorithm for 2D and 3D points?▼

Designing a robust convex hull algorithm requires choosing an appropriate geometric strategy and validating it against a trusted oracle library. This process ensures the algorithm correctly computes the bounding hull and maintains stability across degenerate point distributions.

How do I validate and test triangulation and Voronoi diagram implementations?▼

Validating triangulation and Voronoi diagram implementations involves building comprehensive test corpora and checking algorithm outputs against trusted oracle libraries. This testing methodology confirms that the geometric operations produce topologically correct and mathematically accurate structures.

Can this approach be used for geometric operations in 3D software development?▼

Yes, this computational geometry approach applies directly to software development involving 2D and 3D geometric operations. It provides algorithm design and validation frameworks to ensure robust spatial calculations in complex 3D applications.

Why do my computational geometry calculations fail on edge cases?▼

Computational geometry calculations often fail on edge cases due to a lack of robustness against degeneracies and imprecise numerical computations. Implementing robust geometric predicates and validating against a trusted library resolves these numerical instabilities.