Pages that link to "Item:Q3883495"
From MaRDI portal
The following pages link to Two algorithms for constructing a Delaunay triangulation (Q3883495):
Displayed 49 items.
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← 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)
- 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)
- 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)
- The maximum opposite angulation for mesh construction (Q1774289) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
- An efficient three-dimensional adaptive quasicontinuum method using variable-node elements (Q2390431) (← links)
- A nonconvex, piecewise linear optimization problem (Q2640447) (← links)
- A note on equity across groups in facility location (Q2892131) (← links)
- Second generation wavelets based GIS terrain data compression using Delaunay triangulation (Q3055833) (← links)
- Bayesian Inference for a Random Tessellation Process (Q3078767) (← links)
- Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
- (Q4253886) (← links)
- (Q4344898) (← links)
- DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING (Q4527876) (← links)
- Rapid prototyping through scanned point data (Q4674428) (← links)
- An adaptive mesh algorithm for evolving surfaces: simulations of drop breakup and coalescence (Q5936487) (← links)