Pages that link to "Item:Q1115601"
From MaRDI portal
The following pages link to Constrained Delaunay triangulations (Q1115601):
Displaying 50 items.
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- Multithread parallelization of LEPP-bisection algorithms (Q412318) (← links)
- On triangulation axes of polygons (Q458384) (← links)
- A novel approach to node distribution for 2D mesh generation and its application in marine and ocean engineering (Q602902) (← links)
- Conservative interpolation between unstructured meshes via supermesh construction (Q653593) (← links)
- The legacy of automatic mesh generation from solid modeling (Q672240) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Generating realistic terrains with higher-order Delaunay triangulations (Q870427) (← links)
- Boosted string representation and its application to video surveillance (Q936427) (← links)
- Flips in planar graphs (Q950400) (← links)
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations (Q955223) (← links)
- Triangulating input-constrained planar point sets (Q975526) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Clamshell casting (Q1031870) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Duality of constrained Voronoi diagrams and Delaunay triangulations (Q1206436) (← links)
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (Q1208536) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Point placement algorithms for Delaunay triangulation of polygonal domains (Q1330781) (← links)
- Finding constrained and weighted Voronoi diagrams in the plane (Q1388136) (← links)
- Generating well-shaped \(d\)-dimensional Delaunay meshes. (Q1401265) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- Accelerated robust Boolean operations based on hybrid representations (Q1644369) (← links)
- Preparation of grids for simulations of groundwater flow in fractured porous media (Q1684975) (← links)
- A scalable nonlinear fluid-structure interaction solver based on a Schwarz preconditioner with isogeometric unstructured coarse spaces in 3D (Q1686463) (← links)
- Constrained higher order Delaunay triangulations (Q1776901) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- Surface reconstruction via cooperative evolutions (Q1986129) (← links)
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance (Q2020717) (← links)
- Fast optimal and bounded suboptimal Euclidean pathfinding (Q2060748) (← links)
- MSPOCK: alleviating spatial confounding in multivariate disease mapping models (Q2084438) (← links)
- Periodic triangulations of \(\mathbb{Z}^{n}\) (Q2185226) (← links)
- Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method (Q2206382) (← links)
- Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis (Q2417717) (← links)
- Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation (Q2476570) (← links)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
- Node-based parallel computing of three-dimensional incompressible flows using the free mesh method (Q2486499) (← links)
- Fast dynamic grid deformation based on Delaunay graph mapping (Q2572208) (← links)
- Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization (Q2679326) (← links)
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs (Q2797758) (← links)
- Fast grid-free surface tracking (Q2802379) (← links)
- Interpolation error estimates for harmonic coordinates on polytopes (Q2814652) (← links)
