Minimum degree triangulation for rectangular domains
Journal
Information Processing Letters
Journal Volume
96
Journal Issue
4
Pages
128-135
Date Issued
2005
Date
2005
Author(s)
Abstract
This paper describes an optimal triangulation algorithm for rectangles. We derive lower bounds on the maximum degree of triangulation, and show that our triangulation algorithm matches the lower bounds. Several important observations are also made, including a zig-zag condition that can verify whether a triangulation can minimizes the maximum degree to 4 or not. In addition, this paper identifies the necessary and sufficient condition that there exists a maximum degree 4 triangulation for convex polygons, and gives a linear time checking algorithm. © 2005 Elsevier B.V. All rights reserved.
Subjects
Design of algorithms; Mesh generation; Min-max degree triangulation; Rectangle and convex polygons
Other Subjects
Algorithms; Boundary conditions; Optimization; Design of algorithms; Mesh generation; Min-max degree triangulation; Rectangle and convex polygons; Triangulation
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
06.pdf
Size
151.88 KB
Format
Adobe PDF
Checksum
(MD5):f44848f3021dfb17a72ff627fd6601c8