Edge insertion for optimal triangulations
This paper presents an abstract formulation of a minimax-angle algorithm, called the edge-insertion paradigm, as a general method to compute optimal triangulations. Optimal triangulations figure in areas such as finite element analysis, computational geometry and surface approximations. The paradigm is an abstraction of the algorithm introduced by \textit{H. Edelsbrunner}, \textit{T. S. Tan}, \textit{R. Waupotitsch} [SIAM J. Sci. Stat. Comput. 13, No. 4, 994-10008 (1992; Zbl 0754.65093)]. Two classes of criteria are formulated for which the paradigm computes a global optimum. Application of the paradigm to obtain polynomial time algorithm is discussed. The algorithm is available through anonymous \(ftp\) from the directory ``/SGI/ MinMaxer at the site ``ftp.nsca.UIUC.edu..
- A sweepline algorithm for Voronoi diagrams
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- Data Dependent Triangulations for Piecewise Linear Interpolation
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4028826 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3633695 (Why is no real title available?)
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 3438337 (Why is no real title available?)
- Minimal roughness property of the Delaunay triangulation
- Minimal Triangulations of Polygonal Domains
- On Optimal Interpolation Triangle Incidences
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Voronoi diagrams from convex hulls
- Optimal higher order Delaunay triangulations of polygons
- Tiling space and slabs with acute tetrahedra.
- Constrained higher order Delaunay triangulations
- LMT-skeleton heuristics for several new classes of optimal triangulations
- Optimization for first order Delaunay triangulations
- Algorithms for optimal area triangulations of a convex polygon
- Edge Proximity Conditions for Extendability in Planar Triangulations
- On Optimal Interpolation Triangle Incidences
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- scientific article; zbMATH DE number 1222815 (Why is no real title available?)
- scientific article; zbMATH DE number 1163631 (Why is no real title available?)
- scientific article; zbMATH DE number 1985293 (Why is no real title available?)
- Computing MaxMin edge length triangulations
- Computing MaxMin edge length triangulations
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
- Dilation-Optimal Edge Deletion in Polygonal Cycles
- Optimal Triangulation with Steiner Points
- Optimal Higher Order Delaunay Triangulations of Polygons
- Computational Science and Its Applications – ICCSA 2004
- On -skeleton as a subgraph of the minimum weight triangulation
- One strike against the min-max degree triangulation problem
- Solving the minimum convex partition of point sets with integer programming
- A linear time algorithm for max-min length triangulation of a convex polygon
- Generating realistic terrains with higher-order Delaunay triangulations
- The neutral case for the min-max triangulation
- Flips in planar graphs
This page was built for publication: Edge insertion for optimal triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368129)
