Constrained Delaunay triangulations
From MaRDI portal
Publication:1115601
DOI10.1007/BF01553881zbMath0664.68042MaRDI QIDQ1115601
Publication date: 1989
Published in: Algorithmica (Search for Journal in Brave)
Voronoi diagramcomputational geometryDelaunay triangulationfinite-element methoddivide-and-conquerconstrained triangulation
Related Items (81)
Higher order Delaunay triangulations ⋮ Provably good mesh generation ⋮ Point placement algorithms for Delaunay triangulation of polygonal domains ⋮ A linear-time construction of the relative neighborhood graph within a histogram ⋮ Accelerated robust Boolean operations based on hybrid representations ⋮ MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION ⋮ On the geodesic Voronoi diagram of point sites in a simple polygon ⋮ Generating realistic terrains with higher-order Delaunay triangulations ⋮ Confidence regions for bivariate probability density functions using polygonal areas ⋮ A novel approach to node distribution for 2D mesh generation and its application in marine and ocean engineering ⋮ Finding constrained and weighted Voronoi diagrams in the plane ⋮ Periodic triangulations of \(\mathbb{Z}^{n}\) ⋮ Preparation of grids for simulations of groundwater flow in fractured porous media ⋮ Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis ⋮ A scalable nonlinear fluid-structure interaction solver based on a Schwarz preconditioner with isogeometric unstructured coarse spaces in 3D ⋮ A note on visibility-constrained Voronoi diagrams ⋮ A Posteriori Error Estimates for Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes ⋮ Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization ⋮ How to teach neural networks to mesh: application on 2-D simplicial contours ⋮ An optimization based multi‐block‐structured grid generation method ⋮ An object‐oriented geometric engine design for discontinuities in unfitted/immersed/enriched finite element methods ⋮ On one approach to the estimation of a triangular element degeneration in a triangulation ⋮ Efficient computation of the geodesic Voronoi diagram of points in a simple polygon ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ Generating well-shaped \(d\)-dimensional Delaunay meshes. ⋮ Автоматическое построение блочно-структурированных расчeтных сеток для турбомашин в программном комплексе TurboR&D.Mesher;Automatic block-structured grid generation in turbo machine blade passages by TurboR&D.Mesher software ⋮ \(r\)-adaptive deep learning method for solving partial differential equations ⋮ Mesh generation for thin layered domains and its application to parallel multigrid simulation of groundwater flow ⋮ Why Do We Need Voronoi Cells and Delaunay Meshes? ⋮ A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method ⋮ On triangulation axes of polygons ⋮ Conservative interpolation between unstructured meshes via supermesh construction ⋮ A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE ⋮ Boosted string representation and its application to video surveillance ⋮ The legacy of automatic mesh generation from solid modeling ⋮ Surface reconstruction via cooperative evolutions ⋮ Flips in planar graphs ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations ⋮ A convex polygon among polygonal obstacle: Placement and high-clearance motion ⋮ Reprint of: Delaunay refinement algorithms for triangular mesh generation ⋮ Unnamed Item ⋮ Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation ⋮ Duality of constrained Voronoi diagrams and Delaunay triangulations ⋮ General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties ⋮ Node-based parallel computing of three-dimensional incompressible flows using the free mesh method ⋮ Lower bounds for computing geometric spanners and approximate shortest paths ⋮ CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE ⋮ Constrained higher order Delaunay triangulations ⋮ Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance ⋮ Shape skeletonization by identifying discrete local symmetries ⋮ A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION ⋮ Enumerating triangulation paths ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs ⋮ Essential Constraints of Edge-Constrained Proximity Graphs ⋮ Fast grid-free surface tracking ⋮ Essential Constraints of Edge-Constrained Proximity Graphs ⋮ Optimal Higher Order Delaunay Triangulations of Polygons ⋮ Towards a definition of higher order constrained Delaunay triangulations ⋮ Triangulations with Circular Arcs ⋮ A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams ⋮ Interpolation error estimates for harmonic coordinates on polytopes ⋮ Fast optimal and bounded suboptimal Euclidean pathfinding ⋮ Optimal higher order Delaunay triangulations of polygons ⋮ There are planar graphs almost as good as the complete graph ⋮ Clamshell casting ⋮ Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time ⋮ MSPOCK: alleviating spatial confounding in multivariate disease mapping models ⋮ Unnamed Item ⋮ Fast dynamic grid deformation based on Delaunay graph mapping ⋮ PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES ⋮ On the complexity of two circle connecting problems ⋮ On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points ⋮ Out-of-core Constrained Delaunay Tetrahedralizations for Large Scenes ⋮ Delaunay refinement algorithms for triangular mesh generation ⋮ Counting triangulations and other crossing-free structures via onion layers ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator ⋮ Fast segment insertion and incremental construction of constrained Delaunay triangulations
Cites Work
This page was built for publication: Constrained Delaunay triangulations
