Pages that link to "Item:Q1078807"
From MaRDI portal
The following pages link to Generalized Delaunay triangulation for planar graphs (Q1078807):
Displaying 26 items.
- A note on finding nearest neighbours and constructing Delaunay triangulation in the plane (Q4225921) (← links)
- Reliable Delaunay‐based mesh generation and mesh improvement (Q4314964) (← links)
- A generalized Delaunay triangulation algorithm with adaptive grid size control (Q4381961) (← links)
- Brittle fracture in polycrystalline microstructures with the extended finite element method (Q4446616) (← links)
- CHARACTERIZING DELAUNAY GRAPHS VIA FIXED POINT THEOREM: A SIMPLE PROOF (Q4642061) (← links)
- MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION (Q4818601) (← links)
- On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points (Q5020223) (← links)
- Fast algorithms for greedy triangulation (Q5056107) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)
- Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks (Q5120158) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5307220) (← links)
- Optimal Triangulation with Steiner Points (Q5387801) (← links)
- Triangulations of Line Segment Sets in the Plane (Q5458851) (← links)
- A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE (Q5695051) (← links)
- Generalizing CGAL Periodic Delaunay Triangulations (Q5874547) (← links)
- Essential Constraints of Edge-Constrained Proximity Graphs (Q5890863) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)
- On one approach to the estimation of a triangular element degeneration in a triangulation (Q6095200) (← links)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304) (← links)
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time (Q6102307) (← links)
- Fast skeleton construction (Q6102331) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
- Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)
