Two algorithms for constructing a Delaunay triangulation
From MaRDI portal
Cites work
- 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
- 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?)
- 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)- On the average length of Delaunay triangulations
- Complementary error bounds for foolproof finite element mesh generation
- Generalized Delaunay triangulation for planar graphs
- An O(N log N) minimal spanning tree algorithm for N points in the plane
- Computing relative neighbourhood graphs in the plane
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A sweepline algorithm for Voronoi diagrams
- On a proposed divide-and-conquer minimal spanning tree algorithm
- Constrained Delaunay triangulations
- Graph theoretical clustering based on limited neighbourhood sets
- On the statistics of vision: The Julesz conjecture
- The \(\gamma\)-neighborhood graph
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- On the randomized construction of the Delaunay tree
- On the complexity of two circle connecting problems
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries
- Creating rectangular bathymetry grids for environmental numerical modelling of gravel-bed rivers
- Remarks on the computation of the horizon of a digital terrain
- Delaunay refinement algorithms for triangular mesh generation
- Three-particle correlations in liquid and amorphous aluminium
- The planar multifacility collection depots location problem
- The meshfree finite volume method with application to multi-phase porous media models
- An interface-fitted mesh generator and virtual element methods for elliptic interface problems
- A scalable nonlinear fluid-structure interaction solver based on a Schwarz preconditioner with isogeometric unstructured coarse spaces in 3D
- Topology optimization of compliant structures and mechanisms using constructive solid geometry for 2-d and 3-d applications
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- The maximum opposite angulation for mesh construction
- There are planar graphs almost as good as the complete graph
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- PORA: a Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit design
- Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- Interpolation of sparse high-dimensional data
- An adaptive binary-tree element subdivision method for evaluation of volume integrals with continuous or discontinuous kernels
- Breakthrough `workarounds' in unstructured mesh generation
- A constrained clustering approach to bounded-error identification of switched and piecewise affine systems
- Exact approaches for the minimum subgraph diameter problem
- Robust optimization of attenuation bands of three-dimensional periodic frame structures
- Gradual cover competitive facility location
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Application of NEM in seepage analysis with a free surface
- Ambiguous phase assignment of discretized 3D geometries in topology optimization
- The obnoxious facilities planar \(p\)-median problem
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- A scoring mechanism for the rank aggregation of network robustness
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- An efficient three-dimensional adaptive quasicontinuum method using variable-node elements
- Evolutionary computation solutions to the circle packing problem
- Fitting concentric circles to measurements
- Location of a distribution center for a perishable product
- A nonconvex, piecewise linear optimization problem
- Bayesian clustering of spatial functional data with application to a human mobility study during COVID-19
- Modeling of acoustic signal energies with a generalized Frank copula. A linguistic conjecture is reviewed
- A note on equity across groups in facility location
- Covering part of a planar network
- The quintile share ratio in location analysis
- Second generation wavelet-based GIS terrain data compression using Delaunay triangulation
- Bayesian inference for a random tessellation process
- Big segment small segment global optimization algorithm on networks
- Direct zigzag search for discrete multi-objective optimization
- The natural element method in solid mechanics
- A faster circle-sweep Delaunay triangulation algorithm
- OPTIMAL DELAUNAY POINT INSERTION
- DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING
- Computational color imaging
- Rapid prototyping through scanned point data
- Integrating the supervised information into unsupervised learning
- Segment-based vs. element-based integration for mortar methods in computational contact mechanics
- Stability Analysis and Parameter Classification of a Reaction-Diffusion Model on an Annulus
- scientific article; zbMATH DE number 7370554 (Why is no real title available?)
- Identifying parent locations in the Neyman-Scott process using Delaunay triangulation
- A linear-time construction of the relative neighborhood graph within a histogram
- New local searches for solving the multi-source Weber problem
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
- Maximizing the minimum cover probability by emergency facilities
- Recursive learning for sparse Markov models
- An adaptive mesh algorithm for evolving surfaces: simulations of drop breakup and coalescence
- A physics-informed neural network technique based on a modified loss function for computational 2D and 3D solid mechanics
- Gradient and uncertainty enhanced sequential sampling for global fit
- The Weber Location Problem: The Threshold Objective
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- 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
- Multiscale analysis of a 3D fibrous collagen tissue
- Large deviation principle for geometric and topological functionals and associated point processes
- Phase-field fracture analysis for implicit geometric model via adaptive extended isogeometric analysis
- 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
- Volumetric coupling approaches for multiphysics simulations on non-matching meshes
- Interactive reverse engineering of CAD models
- A Lagrangian gradient smoothing method for solid-flow problems using simplicial mesh
- Machine learning constructives and local searches for the travelling salesman problem
- Global optimisation of the mean first passage time for narrow capture problems in elliptic domains
- \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
- Why is the 3D Delaunay triangulation difficult to construct?
- A data modeling abstraction for describing triangular mesh algorithms
- Sequence interaction model with applications to TCR-peptide binding
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)
