On the minimality of polygon triangulation

DOI10.1007/BF01933206MaRDI QIDQ751276zbMATH OpenOpenAlexFDO

Authors Chiuyuan Chen, R. C. Chang

Publication date 1990

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01933206

zbMATH Keywords

minimum triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Descriptive geometry (51N05)

Recommendations

• Polygon triangulation: Efficiency and minimality
• Triangulating Simple Polygons and Equivalent Problems
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Triangulating a simple polygon in linear time
• Computing bushy and thin triangulations

Cites work

• scientific article; zbMATH DE number 3767037 (Why is no real title available?)
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Polygon triangulation: Efficiency and minimality
• Triangulating Simple Polygons and Equivalent Problems
• Triangulating a simple polygon
• Visibility and intersection problems in plane geometry

Cited in

(28)

• Approximation for minimum triangulation of convex polyhedra
• Triangulations (tilings) and certain block triangular matrices
• Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
• An exact algorithm for constructing minimum Euclidean skeletons of polygons
• On a property of minimal triangulations
• scientific article; zbMATH DE number 4174383 (Why is no real title available?)
• Polygon triangulation: Efficiency and minimality
• scientific article; zbMATH DE number 1305490 (Why is no real title available?)
• scientific article; zbMATH DE number 1746653 (Why is no real title available?)
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• On convex partitions of polygonal regions
• scientific article; zbMATH DE number 3883608 (Why is no real title available?)
• Finding equal-diameter triangulations in polygons
• On minimal triangulations of products of convex polygons
• The farthest point Delaunay triangulation minimizes angles
• scientific article; zbMATH DE number 2209730 (Why is no real title available?)
• scientific article; zbMATH DE number 2080989 (Why is no real title available?)
• Generating polygons with triangles
• On the Determination of Minimal Facets and Edges of a Polyhedral Set
• Minimum degree triangulation for rectangular domains
• Minimal roughness property of the Delaunay triangulation: A shorter approach
• Polygon Area Decomposition for Multiple-Robot Workspace Division
• Minimizing the number of lattice points in a translated polygon
• The dual diameter of triangulations
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
• scientific article; zbMATH DE number 6938032 (Why is no real title available?)
• Draining a polygon-or-rolling a ball out of a polygon

This page was built for publication: On the minimality of polygon triangulation

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