Computing Dirichlet Tessellations in the Plane
From MaRDI portal
Publication:4157261
Cited in
(96)- On the statistics of vision: The Julesz conjecture
- Natural neighbor Galerkin methods
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D
- Parallel geometric algorithms for multi-core computers
- A natural neighbour-based moving least-squares approach for the element-free Galerkin method
- Two algorithms for constructing a Delaunay triangulation
- Properties of n-dimensional triangulations
- Hybrid meshing using constrained Delaunay triangulation for viscous flow simulations
- Efficient data structures for adaptive remeshing with the FEM
- A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- HCPO: an efficient insertion order for incremental Delaunay triangulation
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- Studies in the robustness of multidimensional scaling: euclidean models and simulation studies
- A new algorithm for three-dimensional Voronoi tessellation
- Adjacency for grid generation and grid adaptation in Delaunay triangulation
- Energy-based simulation of concrete cracking using an improved mixed-mode cohesive crack model within a meshless discretization
- A free-Lagrange method for unsteady compressible flow: Simulation of a confined cylindrical blast wave
- A vector identity for the Dirichlet tessellation
- A local search algorithm for ray-convex polyhedron intersection
- Transient heat conduction analysis using the MLPG method and modified precise time step integration method
- The natural element method in solid mechanics
- On the randomized construction of the Delaunay tree
- Delaunay triangulation and the convex hull of n points in expected linear time
- A survey of curve and surface methods in CAGD
- Modelling Heterogeneous Space–Time Occurrences of Earthquakes and its Residual Analysis
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Bayesian partition modelling.
- On the stabbing number of a random Delaunay triangulation
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- AGTHOM—automatic generation of triangular and higher order meshes
- ON DELETION IN DELAUNAY TRIANGULATIONS
- New concepts for moving least squares: an interpolating non-singular weighting function and weighted nodal least squares
- Surfaces in computer aided geometric design: A survey with new results
- A sweepline algorithm for Voronoi diagrams
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Clustering of multivariate geostatistical data
- An apporach to automatic three-dimensional finite element mesh generation
- Approximating surfaces by moving total least squares method
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries
- Simulation of some spatial hard core models, and the complete packing problem
- The maximum opposite angulation for mesh construction
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Voronoi diagrams over dynamic scenes
- Modeling of magneto-electro-elastic problems by a meshless local natural neighbor interpolation method
- Bayesian inference for spatially inhomogeneous pairwise interacting point processes
- A comparison of sequential Delaunay triangulation algorithms.
- Expected time analysis for Delaunay point location
- Nonobtuse triangulation of polygons
- THE SHUFFLING BUFFER
- A class of two-type point processes
- Lattice element models and their peculiarities
- Practical distribution-sensitive point location in triangulations
- OPTIMAL DELAUNAY POINT INSERTION
- Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process
- Triangular meshes for regions of complicated shape
- Surfaces over Dirichlet tessellations
- Modeling categorical covariates for lifetime data in the presence of cure fraction by Bayesian partition structures
- WALKING IN A TRIANGULATION
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- An \(n\)-dimensional Clough-Tocher interpolant
- Application of NEM in seepage analysis with a free surface
- Parallel refinement and coarsening of tetrahedral meshes
- A straightforward iterative algorithm for the planar Voronoi diagram
- Triangulation automatique d’un polyèdre en dimension $N$
- Dynamic elastoplastic analysis using the meshless local natural neighbor interpolation method
- How to construct a partition when preference sets are given
- Graphs and closed surfaces associated with a pairing of edges for regular polygons
- Smoothly mixing regressions
- Second generation wavelet-based GIS terrain data compression using Delaunay triangulation
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
- The stochastic walk algorithms for point location in pseudo-triangulations
- Relay pursuit of a maneuvering target using dynamic Voronoi diagrams
- The algorithm for three-dimensional Voronoi polyhedra
- DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS
- Performance of the MLPG method for static shakedown analysis for bounded kinematic hardening structures
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- A material based finite element analysis of heterogeneous media involving Dirichlet tessellations
- scientific article; zbMATH DE number 7370554 (Why is no real title available?)
- A free-Lagrange augmented Godunov method for the simulation of elastic-plastic solids.
- Dynamics of a single particle moving on a random Lorentz lattice-gas
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
- Influence of reinforcement arrangement on the local reinforcement stresses in composite materials
- Global and local remeshing algorithms for compressible flows
- \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
- Turbulence modeling for computing viscous high-Reynolds-number flows on unstructured meshes
- A method for generating irregular computational grids in multiply connected planar domains
- Covariance approximation for large multivariate spatial data sets with an application to multiple climate model errors
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- The relative neighbourhood graph of a finite planar set
- Interior point tracking in shape evolving unstructured finite element meshes
- Covolume techniques for anisotropic media
- Bayesian partitioning for estimating disease risk
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
- Estimating spatial covariance using penalised likelihood with weightedL1penalty
This page was built for publication: Computing Dirichlet Tessellations in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157261)