← Back
Home › Systems › Engineering design and CAx

mechanical-cad

parametric 3D CAD application

SolidWorks, CATIA, Siemens NX

SystemTechniques · 14Primitives · 28 mechanical-cad Three-way mergedistributed · medium: Merge two descendants against their common ancestor: take whichever side changed, report a conflict only where both changed the same spot differently.›B rep topologygeometry · medium: Boundary representation: solids as shells, faces, loops, edges and vertices with geometry attachedGeometric constraint solvinggeometry · medium: Solve sketch constraints (distance, tangent, parallel) by graph decomposition and Newton iterationLabel placement collisiongeometry · medium: Place map labels and icons without overlap using a collision grid and prioritiesNurbsgeometry · medium: B-splines and NURBS curves and surfaces: knot vectors, de Boor evaluation, knot insertionPersistent topological naminggeometry · medium: Give faces and edges stable identities across parametric rebuilds by tracking their generating features and geometric historyPolygon tessellationgeometry · medium: Triangulate polygons with holes (ear clipping, earcut, monotone sweep)Exact geometric predicatesgeometry · low: Robust orient and incircle tests with adaptive-precision floats (Shewchuk) or exact arithmeticStrongly connected componentsgraphs · low: Tarjan/Kosaraju SCCs for cycle detection in dependency graphsNewton root findingnumerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.›Bounding volume hierarchyphysics · low: Binary tree of nested bounding boxes; prunes overlap and ray queries to O(log n) for any size distribution, and supports cheap insert/remove for moving objects.›Topological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Undo redographics · low: Command or snapshot history with grouping and coalescingOptimistic concurrency controlstorage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.›Lowest common ancestorgraphs · low: LCA/merge-base computation in trees and DAGsHalf edge meshgraphics · low: Half-edge mesh connectivity for editable polygon meshesd-ary heapdata-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.›R-treegeometry · low: A balanced tree of nested bounding boxes that indexes rectangles and points, answering window and nearest-neighbour queries by pruning whole subtrees.›Spatial hashingphysics · low: Uniform grid stored in a hash table: bucket objects by cell, test only neighbouring cells; O(n) neighbour search for many similar-sized objects such as particles.›Bézier curvesgraphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.›Spline interpolationnumerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tablesInterval arithmeticnumerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric testsBFS and DFSgraphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.›+ 7 more techniques+ 12 more primitives

Similar systems

Share the most building blocks with this one.

bim-authoring 42 %cad-kernel 38 %mesh-generator 20 %