Minimal Triangulations of Polygonal Domains
From MaRDI portal
Cited in
(54)- Optimal higher order Delaunay triangulations of polygons
- On approximation behavior of the greedy triangulation for convex polygons
- Algorithms for minimum length partitions of polygons
- The farthest point Delaunay triangulation minimizes angles
- Computing bushy and thin triangulations
- Computing the minimum weight triangulation of a set of linearly ordered points
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- Polynomial-time instances of the minimum weight triangulation problem
- Approximating the minimum weight Steiner triangulation
- Computing a subgraph of the minimum weight triangulation
- Drawing outerplanar minimum weight triangulations
- Advancing mesh completion for digital modeling and manufacturing
- The dual diameter of triangulations
- LMT-skeleton heuristics for several new classes of optimal triangulations
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Improved boundary constrained tetrahedral mesh generation by shell transformation
- Edge insertion for optimal triangulations
- Parallel adaptive simplical re-meshing for deforming domain CFD computations
- Minimum weight pseudo-triangulations
- Approximation algorithms for decomposing octilinear polygons
- Algorithms for optimal area triangulations of a convex polygon
- Plane graphs with parity constraints
- Triangulating a convex polygon with fewer number of non-standard bars
- Fast greedy triangulation algorithms.
- Adaptive tetrahedral meshing in free-surface flow
- Progress on maximum weight triangulation
- The minimum weight triangulation problem with few inner points
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
- A New Heuristic for Minimum Weight Triangulation
- On triangulation axes of polygons
- New results on stabbing segments with a polygon
- DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
- ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
- A comparison of hole-filling methods in 3D
- Solving large-scale minimum-weight triangulation instances to provable optimality
- Orbiting triangle method for convex polygon triangulation
- On plane subgraphs of complete topological drawings
- Optimal Higher Order Delaunay Triangulations of Polygons
- Minimum weight convex Steiner partitions
- On a linear program for minimum-weight triangulation
- On exclusion regions for optimal triangulations
- A lower bound for -skeleton belonging to minimum weight triangulations
- A new subgraph of minimum weight triangulations
- Filling gaps in the boundary of a polyhedron
- Optimal area polygonisation problems: mixed integer linear programming models
- Quantum speedups for polynomial-time dynamic programming algorithms
- Incremental algorithm and local search for minimum non-obtuse triangulations (CG challenge)
- Tetrahedral mesh improvement using multi-face retriangulation
- Dynamic programming bi-criteria combinatorial optimization
- Steiner reducing sets of minimum weight triangulations: Structure and topology
- Minimum k-partitioning of rectilinear polygons
- The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation
This page was built for publication: Minimal Triangulations of Polygonal Domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898497)
