Pages that link to "Item:Q3883495"
From MaRDI portal
The following pages link to Two algorithms for constructing a Delaunay triangulation (Q3883495):
Displaying 50 items.
- Covering part of a planar network (Q291695) (← links)
- The quintile share ratio in location analysis (Q296717) (← links)
- Direct zigzag search for discrete multi-objective optimization (Q337599) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Integrating the supervised information into unsupervised learning (Q474417) (← links)
- Segment-based vs. element-based integration for mortar methods in computational contact mechanics (Q487933) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution (Q512989) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Recursive learning for sparse Markov models (Q516456) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- The shape optimization of the arterial graft design by level set methods (Q729677) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- Two design principles of geometric algorithms in finite-precision arithmetic (Q749243) (← links)
- Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- Learning constitutive relations from indirect observations using deep neural networks (Q781968) (← links)
- Delaunay triangulation and the convex hull of n points in expected linear time (Q799379) (← links)
- Analysis of structure and strain at the meso-scale in 2D granular materials (Q837854) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- Complementary error bounds for foolproof finite element mesh generation (Q1062742) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
- Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- On a proposed divide-and-conquer minimal spanning tree algorithm (Q1115202) (← links)
- Constrained Delaunay triangulations (Q1115601) (← links)
- Graph theoretical clustering based on limited neighbourhood sets (Q1163319) (← links)
- On the statistics of vision: The Julesz conjecture (Q1169430) (← links)
- The \(\gamma\)-neighborhood graph (Q1194312) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (Q1208536) (← links)
- On the randomized construction of the Delaunay tree (Q1210297) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation (Q1334610) (← links)
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries (Q1362260) (← links)
- Creating rectangular bathymetry grids for environmental numerical modelling of gravel-bed rivers (Q1384382) (← links)
- Remarks on the computation of the horizon of a digital terrain (Q1412555) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Three-particle correlations in liquid and amorphous aluminium (Q1620642) (← links)
- The planar multifacility collection depots location problem (Q1628125) (← links)
- The meshfree finite volume method with application to multi-phase porous media models (Q1685186) (← links)
