Two algorithms for constructing a Delaunay triangulation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- scientific article; zbMATH DE number 3410828 (Why is no real title available?)
- A triangulation algorithm for arbitrary planar domains
- Computing Dirichlet Tessellations in the Plane
- Convex hulls of finite sets of points in two and three dimensions
- Decomposition of Polygons into Convex Sets
- On the homogeneous planar Poisson point process
- Packing of congruent spheres in a strip
- Piecewise Quadratic Approximations on Triangles
- Random Subdivisions of Space into Crystals
- Reconstructing Patterns from Sample Data
- Triangulating a simple polygon
- Triangulation of planar regions with applications
- Two Dimensional Interpolation from Random Data
Cited in
(only showing first 100 items - show all)- Fitting concentric circles to measurements
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- Stability Analysis and Parameter Classification of a Reaction-Diffusion Model on an Annulus
- Maximizing the minimum cover probability by emergency facilities
- Bayesian inference for a random tessellation process
- An interface-fitted mesh generator and virtual element methods for elliptic interface problems
- \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
- Topology optimization of compliant structures and mechanisms using constructive solid geometry for 2-d and 3-d applications
- A Lagrangian gradient smoothing method for solid-flow problems using simplicial mesh
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- Solving scheduling and location problems in the plane simultaneously
- Recursive learning for sparse Markov models
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- An efficient three-dimensional adaptive quasicontinuum method using variable-node elements
- Big segment small segment global optimization algorithm on networks
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Elliptical Slice Sampling for Probabilistic Verification of Stochastic Systems with Signal Temporal Logic Specifications
- Convergence analysis of distributed population dynamics based on second-order Delaunay triangulation
- Breakthrough `workarounds' in unstructured mesh generation
- Why is the 3D Delaunay triangulation difficult to construct?
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
- A data modeling abstraction for describing triangular mesh algorithms
- On the statistics of vision: The Julesz conjecture
- The planar multifacility collection depots location problem
- Creating rectangular bathymetry grids for environmental numerical modelling of gravel-bed rivers
- PORA: a Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit design
- A constrained clustering approach to bounded-error identification of switched and piecewise affine systems
- A note on equity across groups in facility location
- Gradient and uncertainty enhanced sequential sampling for global fit
- Rapid prototyping through scanned point data
- Multiscale analysis of a 3D fibrous collagen tissue
- Volumetric coupling approaches for multiphysics simulations on non-matching meshes
- Distribution-free online change detection for low-rank images
- Interactive reverse engineering of CAD models
- Gradual cover competitive facility location
- Remarks on the computation of the horizon of a digital terrain
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- Modeling of acoustic signal energies with a generalized Frank copula. A linguistic conjecture is reviewed
- Complementary error bounds for foolproof finite element mesh generation
- Robust optimization of attenuation bands of three-dimensional periodic frame structures
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- Analysis of structure and strain at the meso-scale in 2D granular materials
- On the combined inverse-square effect of multiple points in multidimensional space
- Three-particle correlations in liquid and amorphous aluminium
- On a proposed divide-and-conquer minimal spanning tree algorithm
- The \(\gamma\)-neighborhood graph
- Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery
- A faster circle-sweep Delaunay triangulation algorithm
- Inferring Independent Sets of Gaussian Variables after Thresholding Correlations
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- The natural element method in solid mechanics
- Global-local adaptive meshing method for phase-field fracture modeling
- The obnoxious facilities planar \(p\)-median problem
- Covering part of a planar network
- A physics-informed neural network technique based on a modified loss function for computational 2D and 3D solid mechanics
- On the randomized construction of the Delaunay tree
- On the average length of Delaunay triangulations
- The quintile share ratio in location analysis
- Delaunay triangulation and the convex hull of n points in expected linear time
- A coupled FEM-VEM approach for crack tracking in quasi-brittle materials
- \textsf{Scanner}: simultaneously temporal trend and spatial cluster detection for spatial-temporal data
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- Location of a distribution center for a perishable product
- Generalized coverage: new developments in covering location models
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Minimal roughness property of the Delaunay triangulation
- Ambiguous phase assignment of discretized 3D geometries in topology optimization
- The shape optimization of the arterial graft design by level set methods
- A sweepline algorithm for Voronoi diagrams
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Machine learning constructives and local searches for the travelling salesman problem
- Computational color imaging
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries
- The maximum opposite angulation for mesh construction
- A scoring mechanism for the rank aggregation of network robustness
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- There are planar graphs almost as good as the complete graph
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- Large deviation principle for geometric and topological functionals and associated point processes
- Global optimisation of the mean first passage time for narrow capture problems in elliptic domains
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
- Direct zigzag search for discrete multi-objective optimization
- OPTIMAL DELAUNAY POINT INSERTION
- DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING
- Phase-field fracture analysis for implicit geometric model via adaptive extended isogeometric analysis
- Integrating the supervised information into unsupervised learning
- New local searches for solving the multi-source Weber problem
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- Graph theoretical clustering based on limited neighbourhood sets
- Computing relative neighbourhood graphs in the plane
- Exact approaches for the minimum subgraph diameter problem
- A nonconvex, piecewise linear optimization problem
- Extreme distance distributions of Poisson Voronoi cells
- Delaunay refinement algorithms for triangular mesh generation
- Segment-based vs. element-based integration for mortar methods in computational contact mechanics
This page was built for publication: Two algorithms for constructing a Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883495)
