Progress on maximum weight triangulation

DOI10.1016/J.COMGEO.2005.11.001zbMATH Open1114.65023OpenAlexW2030923360MaRDI QIDQ2489534FDOQ2489534

Authors: Jianbo Qian, Cao An Wang 

Publication date: 28 April 2006

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

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

zbMATH Keywords

algorithmconstant approximationpolynomial-time 4.238-approximation

Mathematics Subject Classification ID

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

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• Title not available (Why is that?)
• Maximum weight triangulation and graph drawing
• Minimal Triangulations of Polygonal Domains
• Title not available (Why is that?)
• On approximation behavior of the greedy triangulation for convex polygons
• Title not available (Why is that?)

Cited In (2)

• A note on a QPTAS for maximum weight triangulation of planar point sets
• Further results on the Bruijn weight classes

This page was built for publication: Progress on maximum weight triangulation

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