154 packages found
Constrained Delaunay Triangulation in 2D
- constrained
- delaunay
- triangulation
- polygon
- planar
- graph
- vertex
- geometry
- cdt
- 2d
- triangle
- edge
- point
- robust
- View more
Computes circumcenters of simplices
Topological indexing for simplicial complexes
Computes the closest point to a polytope in arbitrary dimensions
intersect a ray and triangle in 3 dimensions
angle between the center and each corner of a regular minimal polygon in n dimensions
Helper module that converts an array of quad indices to an array of triangles indices
Extract a contour on a simplicial complex
Compares two angles with a common edge
calculate the angle between two triangles in 3d with a shared edge
Converts points to barycentric coordinates
A level-of-detail triangle geometry base meant to graph 2d alorithms. Great for landscapes.
return whether an array of points (in any dimension) describe a triangle
Helper module that converts an array of quad indices to an array of triangles indices
A Bounding Volume Hierarchy data structure, for fast ray-mesh intersection
Progressive triangle streams
An implementation of the Watertight Ray/Triangle Intersection algorithm
A set of formulas for solving a triangle
Check if a point is inside a triangle
Simple javascript module for triangulation.