Minimal Triangulations of Polygonal Domains
From MaRDI portal
Publication:3898497
DOI10.1016/S0167-5060(08)70044-XzbMath0452.05002OpenAlexW1547668367MaRDI QIDQ3898497
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70044-x
Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Computing a subgraph of the minimum weight triangulation, Edge insertion for optimal triangulations, Parallel adaptive simplical re-meshing for deforming domain CFD computations, On approximation behavior of the greedy triangulation for convex polygons, Drawing outerplanar minimum weight triangulations, Advancing mesh completion for digital modeling and manufacturing, Algorithms for minimum length partitions of polygons, Minimum weight pseudo-triangulations, DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND, ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY, Approximation algorithms for decomposing octilinear polygons, Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound, The dual diameter of triangulations, Steiner reducing sets of minimum weight triangulations: Structure and topology, Algorithms for optimal area triangulations of a convex polygon, Blockers for triangulations of a convex polygon and a geometric maker-breaker game, FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM, Extensions of dynamic programming for multi-stage combinatorial optimization, Minimum k-partitioning of rectilinear polygons, Plane graphs with parity constraints, On triangulation axes of polygons, A New Heuristic for Minimum Weight Triangulation, New results on stabbing segments with a polygon, The farthest point Delaunay triangulation minimizes angles, Filling gaps in the boundary of a polyhedron, Triangulating a convex polygon with fewer number of non-standard bars, Computing bushy and thin triangulations, Orbiting triangle method for convex polygon triangulation, On plane subgraphs of complete topological drawings, A comparison of hole-filling methods in 3D, Computing the minimum weight triangulation of a set of linearly ordered points, On exclusion regions for optimal triangulations, Fast greedy triangulation algorithms., Adaptive tetrahedral meshing in free-surface flow, Minimum weight convex Steiner partitions, Progress on maximum weight triangulation, The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation, A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations, The minimum weight triangulation problem with few inner points, Optimal Higher Order Delaunay Triangulations of Polygons, Improved boundary constrained tetrahedral mesh generation by shell transformation, Unnamed Item, Heuristics for optimum binary search trees and minimum weight triangulation problems, Optimal higher order Delaunay triangulations of polygons, Dynamic programming bi-criteria combinatorial optimization, LMT-skeleton heuristics for several new classes of optimal triangulations, Unnamed Item, Polynomial-time instances of the minimum weight triangulation problem, Approximating the minimum weight Steiner triangulation
