Minimum degree triangulation for rectangular domains

DOI10.1016/J.IPL.2005.07.002zbMATH Open1184.68566OpenAlexW2056498140MaRDI QIDQ1044720FDOQ1044720

Authors: Pangfeng Liu 

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/155126/1/06.pdf

Recommendations

• scientific article; zbMATH DE number 2080989
• On the minimality of polygon triangulation
• Approximation for minimum triangulation of convex polyhedra
• Minimum vertex hulls for polyhedral domains
• scientific article; zbMATH DE number 4206037
• Minimum rectilinear polygons for given angle sequences
• Minimum rectilinear polygons for given angle sequences
• Rectilinear convex hull with minimum area
• Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
• Fast minimal triangulation algorithm using minimum degree criterion

zbMATH Keywords

design of algorithmsmesh generationmin-max degree triangulationrectangle and convex polygons

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Delaunay triangulation in computational fluid dynamics
• Divergence preserving discrete surface integral methods for Maxwell's curl equations using non-orthogonal unstructured grids
• One strike against the min-max degree triangulation problem

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Minimum degree triangulation for rectangular domains

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