Pages that link to "Item:Q1060525"
From MaRDI portal
The following pages link to A storage-efficient method for construction of a Thiessen triangulation (Q1060525):
Displaying 13 items.
- Properties of \(n\)-dimensional triangulations (Q578840) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
- Approximation and geometric modeling with simplex B-splines associated with irregular triangles (Q751749) (← links)
- The neutral case for the min-max triangulation (Q915345) (← links)
- Derivative generation from multivariate scattered data by functional minimization (Q1070756) (← links)
- Parametrization and smooth approximation of surface triangulations (Q1392044) (← links)
- The maximum opposite angulation for mesh construction (Q1774289) (← links)
- Scattered data interpolation based upon generalized minimum norm networks (Q2277746) (← links)
- Preferred directions for resolving the non-uniqueness of Delaunay triangulations (Q2489018) (← links)
- A Simple and Efficient Method for Modeling Constant Mean Curvature Surfaces (Q2947044) (← links)
- Geometrically based, automatic generator for irregular triangular networks (Q3136769) (← links)
- Parallel grid generation/optimization using block-domain decomposition (Q4015092) (← links)
