Algorithms for optimal area triangulations of a convex polygon

DOI10.1016/J.COMGEO.2006.03.004zbMATH Open1102.65026OpenAlexW1965735113MaRDI QIDQ2432732FDOQ2432732

Authors: J. Mark Keil, Tzvetalin S. Vassilev 

Publication date: 25 October 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.03.004

Recommendations

• Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons
• A linear time algorithm for max-min length triangulation of a convex polygon
• scientific article; zbMATH DE number 2169076
• Approximating the MaxMin and MinMax area triangulations using angular constraints
• Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon

zbMATH Keywords

algorithmsdynamic programmingconvex polygonsMaxMin area triangulationMinMax area triangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Geometry and topology for mesh generation
• Title not available (Why is that?)
• Minimal Triangulations of Polygonal Domains
• Edge insertion for optimal triangulations
• Complexity, convexity, and unimodality

Cited In (18)

• Method for finding and storing optimal triangulations based on square matrix
• Orbiting triangle method for convex polygon triangulation
• Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon
• On approximation behavior of the greedy triangulation for convex polygons
• Title not available (Why is that?)
• Extensions of dynamic programming for multi-stage combinatorial optimization
• Implementation of linear minimum area enclosing triangle algorithm. Application note
• Title not available (Why is that?)
• Approximating the MaxMin and MinMax area triangulations using angular constraints
• Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons
• Title not available (Why is that?)
• Triangle-Based Heuristics for Area Optimal Polygonizations
• A linear time algorithm for max-min length triangulation of a convex polygon
• An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
• Optimal Higher Order Delaunay Triangulations of Polygons
• The dual diameter of triangulations
• Optimal higher order Delaunay triangulations of polygons
• Blockers for triangulations of a convex polygon and a geometric maker-breaker game

This page was built for publication: Algorithms for optimal area triangulations of a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432732)