Generalized Delaunay triangulation for planar graphs
From MaRDI portal
Publication:1078807
DOI10.1007/BF02187695zbMath0596.52007MaRDI QIDQ1078807
Publication date: 1986
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130991
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (2) dimensions (including convex curves) (52A10) Graph theory (05C99)
Related Items
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, Representing stereo data with the Delaunay triangulation, OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS, A framework for advancing front techniques of finite element mesh generation, MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION, Constrained Delaunay triangulations, On the geodesic Voronoi diagram of point sites in a simple polygon, A space efficient greedy triangulation algorithm, Voronoi diagrams with barriers and the shortest diagonal problem, Reliable Delaunay‐based mesh generation and mesh improvement, A note on visibility-constrained Voronoi diagrams, 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, Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time, Fast skeleton construction, Shortcut hulls: vertex-restricted outer simplifications of polygons, Optimal Area Polygonization by Triangulation and Visibility Search, A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, On triangulation axes of polygons, Conservative interpolation between unstructured meshes via supermesh construction, Optimal Triangulation with Steiner Points, A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE, Local properties of geometric graphs, Counting Plane Graphs with Exponential Speed-Up, Flips in planar graphs, Pre-triangulations and liftable complexes, Fast algorithms for greedy triangulation, 3D boundary recovery by constrained Delaunay tetrahedralization, Generating free-form grid truss structures from 3D scanned point clouds, Optimal time bounds for some proximity problems in the plane, An upper bound for conforming Delaunay triangulations, A convex polygon among polygonal obstacle: Placement and high-clearance motion, Reprint of: Delaunay refinement algorithms for triangular mesh generation, Detecting and decomposing self-overlapping curves, Efficiently updating constrained Delaunay triangulations, Duality of constrained Voronoi diagrams and Delaunay triangulations, General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties, Fast greedy triangulation algorithms., Node-based parallel computing of three-dimensional incompressible flows using the free mesh method, Fast algorithms for greedy triangulation, Sequences of spanning trees and a fixed tree theorem, Essential Constraints of Edge-Constrained Proximity Graphs, Pointed binary encompassing trees: simple and optimal, Triangulations of Line Segment Sets in the Plane, Vertex-colored encompassing graphs, Brittle fracture in polycrystalline microstructures with the extended finite element method, Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time, Approximating uniform triangular meshes in polygons., Geometric biplane graphs. I: Maximal graphs, On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points, Delaunay refinement algorithms for triangular mesh generation, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator, Fast segment insertion and incremental construction of constrained Delaunay triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Visibility of disjoint polygons
- A linear algorithm for finding the convex hull of a simple polygon
- Triangulating a simple polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- Visibility of a simple polygon
- On finding the convex hull of a simple polygon
- Optimal Point Location in a Monotone Subdivision
- Two algorithms for constructing a Delaunay triangulation
- Generalization of Voronoi Diagrams in the Plane
- A linear algorithm for computing the visibility polygon from a point
- Optimal Search in Planar Subdivisions
- Two Dimensional Interpolation from Random Data
- On the Angle Condition in the Finite Element Method
- Location of a Point in a Planar Subdivision and Its Applications
- Piecewise Quadratic Approximations on Triangles
- Automatic triangulation of arbitrary planar domains for the finite element method
- Triangular Elements in the Finite Element Method
- Finding the convex hull of a simple polygon
