Toggle Quick Contact Bar

Projects

  • main_image_suggestion

    Mean Curvature Flow Skeletonization

    • Date Completed: December 2013

    Given a closed triangulated surface mesh, the algorithm iteratively contracts the surface mesh along the surface mean curvature flow until convergence. A 1D skeleton is then extracted from the contracted surface. The skeleton encodes the…

  • Screenshot from 2015-04-02 14:45:58

    Shortest Path on Triangulated Surface Mesh

    • Date Completed: December 2014

    Given a triangulated surface mesh as input and a set of source points on the mesh, the algorithm computes a data structure that can efficiently answer shortest path queries from any point on the mesh…

  • Screenshot from 2015-04-02 14:41:03

    Reconstruction From Parallel Slices

    • Date Completed: December 2013

    Given a set of polygons in parallel contour this algorithm creates a manifold surface mesh.

  • Screenshot from 2015-04-02 14:31:23

    Hole Filling

    • Client: Prototype
    • Date Completed: September 2013 (To be integrated in CGAL 4.7 or 4.8)

    Implements a hole filling algorithm with fairing and refinement.

  • slicer

    Triangle Mesh Slicer

    • Client: Prototype (integrated in CGAL 4.6 Polyhedron demo)
    • Date Completed: January 2015

    Given a triangle mesh and a plane as input, computes the intersection of the mesh with the input as a polyline and set of points.

  • overlay

    Robust Surface Mesh Overlay

    • Date Completed: December 2013

    Given two input surface meshes (not necessarily triangulated) representing the same model, this component produces a third triangle mesh where each face of each input mesh is represented by a collection of faces of the…

  • mesh_940px

    Tetrahedral Mesh Generation for Therapy Planning

    • Client: Zuse-Institut Berlin
    • Date Completed: December 2012

    Based on the CGAL 3D Meshing Generation package an extension has been developed that allows to automatically create tetrahedral grids suitable for finite element analysis. This work is part of the European project MXL, ICT-2009.5.2.

  • LiDAR_Classification_for_CGAL

    Constrained Delaunay Triangulations for Photogrammetry

    • Date Completed: March 2012

    Intergraph’s LPS, a complete suite of photogrammetric production tools, uses the CGAL 2D Delaunay triangulation to perform terrain segmentation, building footprint delineation, and terrain classification on LiDAR point clouds.

  • beispiel_filialen_neu_karte

    Alpha Shapes for Computing Catchment Areas

    • Client: IVU Traffic Technologies
    • Date Completed: February 2012

    Based on weighted graphs representing transport connections, and the CGAL 2D Alpha Shapes the geographical information system IVU.locate* allows to compute catchment areas and hence to identify the optimum location for stores and its customers.

  • StraightSkeleton

    Straight Skeleton for Modeling Roofs

    • Client: Esri
    • Date Completed: December 2010

    The CGAL 2D Straight Skeleton is used for modeling roofs in the Esri CityEngine, a software product for the efficient creation of 3D cities and buildings. Straight skeletons are further used for computing offset polygons…

  • acute3d

    Surface Meshes from Aerial Images

    • Client: Acute3D
    • Date Completed: June 2011

    Acute3D develops software that allows to build real-3D, high resolution models from simple photographs. They use the CGAL 3D Delaunay triangulation and the AABB Tree, a data structure that allows to perform efficient intersection and…

  • agilent

    Arrangements for Electronic Design Automation

    • Client: Agilent
    • Date Completed: October 2008

    The tri/quad mesh of a small RF board generated with Agilent’s Technologies Advanced Design System uses CGAL Arrangements as backend representation.

  • frac

    Fracture Mesh Generation

    • Client: Prototype
    • Date Completed: December 2011

    Fracture Mesh generation is about creating 2D quality meshes on polygons embedded in 3-space such that triangles conform on polygon intersections.

  • deformation

    As Rigid As Possible Mesh Deformation

    • Client: Prototype
    • Date Completed: Decembre 2011 (Integration in CGAL 4.5)

    As Rigid as Possible Mesh Deformation allows to deform a region of interest on a surface mesh by displacing a set of handles. This project started as a Google Summer of Code 2011 project of…