A fast algorithm for constructing Delaunay triangulations in the plane
From MaRDI portal
Recommendations
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Delaunay triangulation and the convex hull of n points in expected linear time
- Fast Delaunay triangulation in three dimensions
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Construction of three-dimensional Delaunay triangulations using local transformations
Cited in
(59)- A storage-efficient method for construction of a Thiessen triangulation
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- Adaptive finite element techniques for frictional contact problems involving large elastic strains
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries
- Adaptive Lagrangian modelling of ballistic penetration of metallic targets
- An adaptive finite element algorithm for a two-dimensional stationary Stefan-like problem
- Different a posteriori error estimators and indicators for contact problems.
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- Construction of the Delaunay superlarge triangulation
- Adaptive finite elements for a linear parabolic problem
- An adaptive finite element algorithm for contact problems in plasticity
- Adaptive finite element analysis of fractal interfaces in contact problems
- A comparison of sequential Delaunay triangulation algorithms.
- Fast reconstruction of Delaunay triangulations
- Dual boundary element assessment of three-dimensional fatigue crack growth
- Fast Delaunay triangulation in three dimensions
- A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes
- An optimal algorithm for realizing a Delaunay triangulation
- An algorithm for dynamic Delaunay triangulation of simple polygon
- scientific article; zbMATH DE number 6379407 (Why is no real title available?)
- scientific article; zbMATH DE number 4174387 (Why is no real title available?)
- Rainfall distribution based on a Delaunay triangulation method
- scientific article; zbMATH DE number 4038923 (Why is no real title available?)
- scientific article; zbMATH DE number 4062599 (Why is no real title available?)
- Algorithm 772
- A fast algorithm for generating constrained delaunay triangulations
- scientific article; zbMATH DE number 1240687 (Why is no real title available?)
- A faster circle-sweep Delaunay triangulation algorithm
- OPTIMAL DELAUNAY POINT INSERTION
- USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
- A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
- scientific article; zbMATH DE number 1139074 (Why is no real title available?)
- The numerical modelling of ceramics subject to impact using adaptive discrete element techniques
- DELAUNAY TRIANGULATIONS IN THE PLANE WITH ${\mathcal O} (\sqrt{N} \log N)$ STORAGE REQUIREMENTS
- Comparison of different error estimators for contact problems
- Remark on Algorithm 751
- scientific article; zbMATH DE number 1786514 (Why is no real title available?)
- ANISOTROPIC TRIANGULATION OF PARAMETRIC SURFACES VIA CLOSE PACKING OF ELLIPSOIDS
- Interior point tracking in shape evolving unstructured finite element meshes
- Fast and robust Delaunay tessellation in periodic domains
- Two‐dimensional finite element analysis of a synthetically loaded stator in a piezoelectrically driven ultrasonic motor
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- Graph Drawing
- Numerical simulation of the slider air bearing problem of hard disk drives by two multidimensional upwind residual distribution schemes over unstructured triangular meshes
- ARANEA, a program for generating unstructured triangular meshes with a JAVA graphics user interface
- The stochastic walk algorithms for point location in pseudo-triangulations
- A 3D Lagrangian gradient smoothing method framework with an adaptable gradient smoothing domain-constructing algorithm for simulating large deformation free surface flows
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
- Large-scale semi-discrete optimal transport with distributed Voronoi diagrams
- Contact modeling using step boundary method for immersed boundary finite element method
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- Automatic mesh generation for finite element analysis
- Delaunay triangulation and the convex hull of n points in expected linear time
- Construction of three-dimensional Delaunay triangulations using local transformations
- HCPO: an efficient insertion order for incremental Delaunay triangulation
- Growth based morphogenesis of vertebrate limb bud
This page was built for publication: A fast algorithm for constructing Delaunay triangulations in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765247)
