Computing Dirichlet Tessellations in the Plane
From MaRDI portal
Publication:4157261
DOI10.1093/COMJNL/21.2.168zbMATH Open0377.52001OpenAlexW1982483258MaRDI QIDQ4157261FDOQ4157261
Authors: P. J. Green, Robin Sibson
Publication date: 1978
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/21.2.168
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)
Cited In (96)
- A natural neighbour-based moving least-squares approach for the element-free Galerkin method
- Two algorithms for constructing a Delaunay triangulation
- Parallel geometric algorithms for multi-core computers
- Efficient data structures for adaptive remeshing with the FEM
- Properties of \(n\)-dimensional triangulations
- 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
- A new algorithm for three-dimensional Voronoi tessellation
- Adjacency for grid generation and grid adaptation in Delaunay triangulation
- A vector identity for the Dirichlet tessellation
- A free-Lagrange method for unsteady compressible flow: Simulation of a confined cylindrical blast wave
- A local search algorithm for ray-convex polyhedron intersection
- The natural element method in solid mechanics
- Transient heat conduction analysis using the MLPG method and modified precise time step integration method
- Bayesian partition modelling.
- On the randomized construction of the Delaunay tree
- Modelling Heterogeneous Space–Time Occurrences of Earthquakes and its Residual Analysis
- Delaunay triangulation and the convex hull of n points in expected linear time
- A survey of curve and surface methods in CAGD
- AGTHOM—automatic generation of triangular and higher order meshes
- ON DELETION IN DELAUNAY TRIANGULATIONS
- On the stabbing number of a random Delaunay triangulation
- 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
- An apporach to automatic three-dimensional finite element mesh generation
- Approximating surfaces by moving total least squares method
- Simulation of some spatial hard core models, and the complete packing problem
- A simple unstructured tetrahedral mesh generation algorithm for complex geometries
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Voronoi diagrams over dynamic scenes
- 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
- OPTIMAL DELAUNAY POINT INSERTION
- Practical distribution-sensitive point location in triangulations
- 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
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- WALKING IN A TRIANGULATION
- Parallel refinement and coarsening of tetrahedral meshes
- An \(n\)-dimensional Clough-Tocher interpolant
- Triangulation automatique d’un polyèdre en dimension $N$
- Dynamic elastoplastic analysis using the meshless local natural neighbor interpolation method
- A straightforward iterative algorithm for the planar Voronoi diagram
- Smoothly mixing regressions
- 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
- A free-Lagrange augmented Godunov method for the simulation of elastic-plastic solids.
- Title not available (Why is that?)
- Performance of the MLPG method for static shakedown analysis for bounded kinematic hardening structures
- A material based finite element analysis of heterogeneous media involving Dirichlet tessellations
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
- Turbulence modeling for computing viscous high-Reynolds-number flows on unstructured meshes
- Influence of reinforcement arrangement on the local reinforcement stresses in composite materials
- Global and local remeshing algorithms for compressible flows
- 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
- Interior point tracking in shape evolving unstructured finite element meshes
- The relative neighbourhood graph of a finite planar set
- Bayesian partitioning for estimating disease risk
- Covolume techniques for anisotropic media
- Estimating spatial covariance using penalised likelihood with weightedL1penalty
- Natural neighbor Galerkin methods
- On the statistics of vision: The Julesz conjecture
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D
- Hybrid meshing using constrained Delaunay triangulation for viscous flow simulations
- A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams
- Studies in the robustness of multidimensional scaling: euclidean models and simulation studies
- Energy-based simulation of concrete cracking using an improved mixed-mode cohesive crack model within a meshless discretization
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- Clustering of multivariate geostatistical data
- The maximum opposite angulation for mesh construction
- Modeling of magneto-electro-elastic problems by a meshless local natural neighbor interpolation method
- THE SHUFFLING BUFFER
- A class of two-type point processes
- Lattice element models and their peculiarities
- Modeling categorical covariates for lifetime data in the presence of cure fraction by Bayesian partition structures
- Application of NEM in seepage analysis with a free surface
- How to construct a partition when preference sets are given
- Graphs and closed surfaces associated with a pairing of edges for regular polygons
- Second generation wavelet-based GIS terrain data compression using Delaunay triangulation
- DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS
- The algorithm for three-dimensional Voronoi polyhedra
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- Dynamics of a single particle moving on a random Lorentz lattice-gas
- \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
- 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
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
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)