scientific article; zbMATH DE number 3633698
From MaRDI portal
Publication:4194442
zbMath0407.68033MaRDI QIDQ4194442
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Theory of software (68N99) Differential topology (57Rxx)
Related Items
Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology, A Priori Anisotropic Mesh Adaptation on Implicitly Defined Surfaces, Modeling contours of trivariate data, Why Do We Need Voronoi Cells and Delaunay Meshes?, Image warping using radial basis functions, An adaptive mesh algorithm for evolving surfaces: simulations of drop breakup and coalescence, Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines, Flip Algorithm for Segment Triangulations, Two algorithms for constructing a Delaunay triangulation, Triangulations of Line Segment Sets in the Plane, The Perfect Matching Reconfiguration Problem, Surfaces in computer aided geometric design: A survey with new results, Nonuniform spatial mesh adaptation using a posteriori error estimates: Applications to forward and inverse problems, A survey of curve and surface methods in CAGD, Expected time analysis for Delaunay point location, Edge insertion for optimal triangulations, Data point selection for piecewise trilinear approximation, HCPO: an efficient insertion order for incremental Delaunay triangulation, An \(n\)-dimensional Clough-Tocher interpolant, Computing area filling contours for surfaces defined by piecewise polynomials, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Interpolation over a sphere based upon a minimum norm network, An iterative method for computing multivariate \(C^ 1\) piecewise polynomial interpolants, Parallel unstructured mesh generation by an advancing front method, On the stabbing number of a random Delaunay triangulation, A simple unstructured tetrahedral mesh generation algorithm for complex geometries, An optimal bound for high-quality conforming triangulations, Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains, The edge rotation graph, Constrained paths in the flip-graph of regular triangulations, Quasi-interpolation scheme for arbitrary dimensional scattered data approximation based on natural neighbors and RBF interpolation, A denoising tool for the reconstruction of cortical geometries from MRI, A new adaptive local mesh refinement algorithm and its application on fourth order thin film flow problem, A reduced Hsieh-Clough-Tocher element with splitting based on an arbitrary interior point, A proof of the orbit conjecture for flipping edge-labelled triangulations, Systems of coordinates associated with points scattered in the plane, Flip distance between triangulations of a simple polygon is NP-complete, Multithread parallelization of LEPP-bisection algorithms, Flipping edge-labelled triangulations, An iterative method for the creation of structured hexahedral meshes over complex orography, A faster circle-sweep Delaunay triangulation algorithm, Flip distance between two triangulations of a point set is NP-complete, Remarks on the computation of the horizon of a digital terrain, A straightforward iterative algorithm for the planar Voronoi diagram, Constructing \(C^{1}\) triangular patch of degree six by the Boolean sum of an approximation operator and an interpolation operator, The neutral case for the min-max triangulation, Lifting simplicial complexes to the boundary of convex polytopes, Smooth interpolation of scattered data by local thin plate splines, Flip distance between triangulations of a planar point set is APX-hard, Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree, Fitting of curves and surfaces based on interaction of physical relations and experimental data, On a global optimization algorithm for bivariate smooth functions, Minimum energy triangulations for elliptic problems, Weakly regular subdivisions, Image categorization: Graph edit distance \(+\) edge direction histogram, Vertex based data dependent triangulations, On local transformations in plane geometric graphs embedded on small grids, Boundary correction for piecewise linear interpolation defined over data- dependent triangulations, A characterization of certain \(C^{2}\) discrete triangular interpolants, Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions, Approximating the maxmin-angle covering triangulation, A data modeling abstraction for describing triangular mesh algorithms, Boundary improvement of piecewise linear interpolants defined over Delaunay triangulations, A research note on design of fair surfaces over irregular domains using data-dependent triangulation, Flips in planar graphs, A monotonicity property for weighted Delaunay triangulations, A new finite element of \(C^ 1\) cubic splines, An upper bound for conforming Delaunay triangulations, Reprint of: Delaunay refinement algorithms for triangular mesh generation, Computing optimal triangulations using simulated annealing, Generalised primal-dual grids for unstructured co-volume schemes, General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties, Interpolation of track data with radial basis methods, Non-connected toric Hilbert schemes, An efficient adaptive analysis procedure for node-based smoothed point interpolation method (NS-PIM), Preferred directions for resolving the non-uniqueness of Delaunay triangulations, Multivariate data modelling by metric approximants, Unstructured grid optimization for improved monotonicity of discrete solutions of elliptic equations with highly anisotropic coefficients, Adaptive modification of time evolving meshes, Minimum weight connectivity augmentation for planar straight-line graphs, Properties of \(n\)-dimensional triangulations, A representation of a \(C^ 2\) interpolant over triangles, Scattered data interpolation based upon generalized minimum norm networks, Cubic spline fitting using data dependent triangulations, Parallel geometric algorithms for multi-core computers, Geometric modeling applications in rational drug design: a survey, A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation, Geometric quadrangulations of a polygon, Quality mesh generation for molecular skin surfaces using restricted union of balls, Data-dependent triangulations for scattered data interpolation and finite element approximation, A modified moving least-squares suitable for scattered data fitting with outliers, Interior improvement of piecewise linear interpolants defined over Delaunay triangulations, Minimal roughness property of the Delaunay triangulation, Approximation and geometric modeling with simplex B-splines associated with irregular triangles, On a class of polynomial triangular macro-elements, Analysis of 3D solids using the natural neighbour radial point interpolation method, Best data-dependent triangulations, Introduction to reconfiguration, Shape-preserving interpolation of irregular data by bivariate curvature-based cubic \(L_1\) splines in spherical coordinates, Conditions for cubic spline interpolation on triangular elements, On the average length of Delaunay triangulations, Complementary error bounds for foolproof finite element mesh generation, On sorting triangles in a Delaunay tessellation, \(C^ 1\) surface interpolation with constraints, Transforming triangulations in polygonal domains, Construction of three-dimensional Delaunay triangulations using local transformations, Delaunay refinement algorithms for triangular mesh generation, Smooth parametric surface approximations to discrete data, Regular triangulations of dynamic sets of points, A modified Clough-Tocher interpolant, A data reduction scheme for triangulated surfaces
