The following pages link to (Q4194442):
Displaying 50 items.
- The edge rotation graph (Q367068) (← links)
- Multithread parallelization of LEPP-bisection algorithms (Q412318) (← links)
- An iterative method for the creation of structured hexahedral meshes over complex orography (Q426435) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Lifting simplicial complexes to the boundary of convex polytopes (Q449125) (← links)
- On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
- An efficient adaptive analysis procedure for node-based smoothed point interpolation method (NS-PIM) (Q545990) (← links)
- Properties of \(n\)-dimensional triangulations (Q578840) (← links)
- A representation of a \(C^ 2\) interpolant over triangles (Q580872) (← links)
- Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains (Q598237) (← links)
- Constructing \(C^{1}\) triangular patch of degree six by the Boolean sum of an approximation operator and an interpolation operator (Q639183) (← links)
- Weakly regular subdivisions (Q664551) (← links)
- A characterization of certain \(C^{2}\) discrete triangular interpolants (Q673499) (← links)
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions (Q673501) (← links)
- Approximating the maxmin-angle covering triangulation (Q676589) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- Boundary improvement of piecewise linear interpolants defined over Delaunay triangulations (Q678458) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Computing optimal triangulations using simulated annealing (Q687467) (← links)
- Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
- Approximation and geometric modeling with simplex B-splines associated with irregular triangles (Q751749) (← links)
- On sorting triangles in a Delaunay tessellation (Q802898) (← links)
- Construction of three-dimensional Delaunay triangulations using local transformations (Q807005) (← links)
- HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Constrained paths in the flip-graph of regular triangulations (Q876507) (← links)
- A new adaptive local mesh refinement algorithm and its application on fourth order thin film flow problem (Q886086) (← links)
- A reduced Hsieh-Clough-Tocher element with splitting based on an arbitrary interior point (Q886195) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
- The neutral case for the min-max triangulation (Q915345) (← links)
- Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree (Q920542) (← links)
- Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
- A research note on design of fair surfaces over irregular domains using data-dependent triangulation (Q949998) (← links)
- Flips in planar graphs (Q950400) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- Quality mesh generation for molecular skin surfaces using restricted union of balls (Q1000920) (← links)
- Analysis of 3D solids using the natural neighbour radial point interpolation method (Q1033564) (← links)
- Conditions for cubic spline interpolation on triangular elements (Q1059980) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- Complementary error bounds for foolproof finite element mesh generation (Q1062742) (← links)
- Smooth parametric surface approximations to discrete data (Q1067752) (← links)
- A modified Clough-Tocher interpolant (Q1071471) (← links)
- Surfaces in computer aided geometric design: A survey with new results (Q1079318) (← links)
- A survey of curve and surface methods in CAGD (Q1083171) (← links)
- An \(n\)-dimensional Clough-Tocher interpolant (Q1094612) (← links)
- Computing area filling contours for surfaces defined by piecewise polynomials (Q1094858) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- Interpolation over a sphere based upon a minimum norm network (Q1095567) (← links)
