Pages that link to "Item:Q1078807"
From MaRDI portal
The following pages link to Generalized Delaunay triangulation for planar graphs (Q1078807):
Displaying 50 items.
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- On triangulation axes of polygons (Q458384) (← links)
- Conservative interpolation between unstructured meshes via supermesh construction (Q653593) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Efficiently updating constrained Delaunay triangulations (Q688628) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- Flips in planar graphs (Q950400) (← links)
- Constrained Delaunay triangulations (Q1115601) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- A space efficient greedy triangulation algorithm (Q1120272) (← links)
- Voronoi diagrams with barriers and the shortest diagonal problem (Q1123618) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- Detecting and decomposing self-overlapping curves (Q1200911) (← links)
- Duality of constrained Voronoi diagrams and Delaunay triangulations (Q1206436) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Point placement algorithms for Delaunay triangulation of polygonal domains (Q1330781) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- A framework for advancing front techniques of finite element mesh generation (Q1899932) (← links)
- Generating free-form grid truss structures from 3D scanned point clouds (Q1992896) (← links)
- Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- Local properties of geometric graphs (Q2456666) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Node-based parallel computing of three-dimensional incompressible flows using the free mesh method (Q2486499) (← links)
- Representing stereo data with the Delaunay triangulation (Q2638828) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (Q4210159) (← links)
- Reliable Delaunay‐based mesh generation and mesh improvement (Q4314964) (← links)
- Brittle fracture in polycrystalline microstructures with the extended finite element method (Q4446616) (← 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)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← 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)
- Essential Constraints of Edge-Constrained Proximity Graphs (Q5890863) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)
