awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
CGAL avatar

CGAL/cgal

0
View on GitHub↗
5,757 stars·1,542 forks·C++·other·30 viewsgithub.com/CGAL/cgal#readme↗

Cgal

CGAL is a software library that provides a comprehensive collection of computational geometry algorithms and data structures. It is built around a geometry kernel that defines fundamental geometric primitives and operations, enabling the construction of complex geometric objects and the computation of geometric predicates with exact arithmetic for reliable results.

The library covers a wide range of geometric computation capabilities, including the construction of convex hulls, triangulations of point sets, and the generation of Voronoi diagrams. It also supports the processing of polygonal meshes and point clouds, as well as the computation of arrangements of curves in the plane and Boolean operations on polygons. For spatial analysis, CGAL provides geometric queries such as point location and distance computation, and it can generate high-quality surface and volume meshes for simulation.

Beyond core geometry, CGAL includes optimization solvers for linear and quadratic programs, and offers spatial sorting of geometric objects to accelerate proximity searches. The library is extensible, allowing users to write custom algorithms that integrate with the existing framework, and it provides control over runtime checks and error handling. Documentation is available online for interactive browsing and as downloadable manuals for offline reference.

Features

  • Geometry Kernel Foundations - Provides the foundational geometry kernel that underpins all computational geometry algorithms.
  • Simulation Meshes - Creates high-quality triangular or tetrahedral meshes from input geometries for simulation.
  • Surface and Volume Meshes - Creates meshes from geometric domains for finite element analysis and visualization.
  • Point Cloud Processing - Analyzes and filters unstructured point sets for surface reconstruction.
  • Spatial Data Structures - Constructs complex spatial data structures like triangulations, arrangements, and meshes.
  • Mesh Processing Operations - Applies smoothing, simplification, and hole filling operations on polygonal surfaces.
  • Boolean Polygon Operations - Computes union, intersection, difference, and symmetric difference of polygons and polyhedra.
  • Complex Polygon Modeling - Represents and manipulates cell complexes, polygons, and polyhedra for 3D modeling.
  • Mesh Processing Tools - Provides tools for refining, simplifying, and repairing polygonal surface meshes.
  • Triangulation Generators - Triangulates point sets into triangle or tetrahedral meshes for analysis.
  • Geometric Algorithms - Implements exact geometric predicates for orientation and relative position evaluation.
  • Geometric Intersection Calculators - Performs point location, intersection detection, and distance computation on geometric objects.
  • Convex Hull Computation - Implements convex hull algorithms for 2D and 3D point sets.
  • Spatial Queries - Performs spatial searches such as nearest neighbor and range queries on geometric data.
  • Coordinate-Based Object Constructors - Builds geometric objects like points, vectors, and lines from coordinate data.
  • Voronoi Diagram Generators - Computes Voronoi diagrams from point sets to partition space based on proximity.
  • Geometric Primitives - Provides fundamental geometric primitives like points, lines, and polygons for algorithm construction.
  • Planar Arrangements - Ships algorithms for computing arrangements of curves in the plane.
  • Kernel Number Type Selectors - Allows selection of kernel representation and number type to control arithmetic precision and performance.
  • Spatial Sorting - Sorts geometric objects spatially to accelerate proximity searches and range queries.
  • Spatial Sorting - Orders points or other geometric entities along a space-filling curve for efficient access.
  • Custom Algorithm Extensions - Enables users to write custom data structures and algorithms that integrate with the framework.
  • Mathematical Libraries - Collection of geometric algorithms.

Star history

Star history chart for cgal/cgalStar history chart for cgal/cgal

How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.

AI search

Explore more awesome repositories

Describe what you need in plain English — the AI ranks thousands of curated open-source projects by relevance.

Start searching with AI

Projects sharing features with Cgal

These projects share indexed features with Cgal. Shared tags can include platform or build tooling; verify the primary use case before treating a result as a replacement.
  • shapely/shapelyshapely avatar

    shapely/shapely

    4,455View on GitHub↗

    Shapely is a library for the manipulation and analysis of planar geometric objects, serving as a Python wrapper for the GEOS C++ engine. It provides a framework for calculating geometric properties, evaluating spatial relationships, and performing topological predicates within a Cartesian plane. The project distinguishes itself through a vectorized geometry processor capable of executing spatial operations across large arrays of shapes to increase throughput. It also includes a spatial indexing system based on R-trees to accelerate the retrieval of intersecting geometries and nearest neighbor

    Python
    View on GitHub↗4,455
  • sixlabors/imagesharpSixLabors avatar

    SixLabors/ImageSharp

    7,954View on GitHub↗

    ImageSharp is a .NET image processing library and manipulation framework used for decoding, encoding, and modifying digital images. It functions as a comprehensive toolkit for resizing, cropping, and applying pixel-level filters while managing color profiles and pixel data across various file formats. The project integrates a 2D vector graphics engine and a typography rendering engine to draw geometric shapes, paths, and complex stylized text onto images. It also includes a geometry boolean operation library for calculating intersections, unions, and differences between complex polygons and c

    C#bmpc-sharpdrawing
    View on GitHub↗7,954
  • toblerity/shapelyToblerity avatar

    Toblerity/Shapely

    4,457View on GitHub↗

    Shapely is a geometric analysis library for the manipulation and analysis of planar geometric objects. It functions as a computational geometry toolkit, a spatial predicate engine for evaluating topological relationships, and a vectorized geometry processor. The library distinguishes itself through a vectorized geometry processor capable of executing operations across coordinate arrays with multi-threaded parallel processing. It utilizes prepared geometry optimization to accelerate repeated containment and intersection tests and implements R-tree spatial indexing for efficient nearest-neighbo

    Python
    View on GitHub↗4,457
  • habrador/computational-geometryHabrador avatar

    Habrador/Computational-geometry

    1,465View on GitHub↗

    This project provides a collection of algorithmic implementations for computational geometry, focusing on spatial analysis, mesh construction, and geometric data processing. It serves as a toolkit for generating and manipulating complex shapes, surfaces, and spatial relationships within interactive three-dimensional applications. The library distinguishes itself through a suite of mathematical functions designed for procedural mesh generation and geometric partitioning. It includes specialized routines for calculating convex hulls, performing boolean operations on polygons, and detecting inte

    C#beziercomputational-geometrycomputer-science
    View on GitHub↗1,465
Compare all 30 related projects→

Frequently asked questions

What does cgal/cgal do?

CGAL is a software library that provides a comprehensive collection of computational geometry algorithms and data structures. It is built around a geometry kernel that defines fundamental geometric primitives and operations, enabling the construction of complex geometric objects and the computation of geometric predicates with exact arithmetic for reliable results.

What are the main features of cgal/cgal?

The main features of cgal/cgal are: Geometry Kernel Foundations, Simulation Meshes, Surface and Volume Meshes, Point Cloud Processing, Spatial Data Structures, Mesh Processing Operations, Boolean Polygon Operations, Complex Polygon Modeling.

Which projects share features with cgal/cgal?

Projects with overlapping indexed features include: shapely/shapely — Shapely is a library for the manipulation and analysis of planar geometric objects, serving as a Python wrapper for… sixlabors/imagesharp — ImageSharp is a .NET image processing library and manipulation framework used for decoding, encoding, and modifying… toblerity/shapely — Shapely is a geometric analysis library for the manipulation and analysis of planar geometric objects. It functions as… habrador/computational-geometry — This project provides a collection of algorithmic implementations for computational geometry, focusing on spatial… mission-peace/interview — This project is a comprehensive library of reference implementations for fundamental data structures and algorithms,… g-truc/glm — This project is a header-only C++ library designed for graphics mathematics, providing a comprehensive suite of…