QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES
2000 ◽
Vol 10
(01)
◽
pp. 1-40
◽
Keyword(s):
We present a linear–time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear–time algorithm for such decompositions, too. As an application, we consider the problem of constructing a minimum conformal refinement of a mesh in the three–dimensional space, which approximates the surface of a workpiece. We prove that this problem is strongly [Formula: see text] –hard, and we present a linear-time algorithm with a constant approximation ratio of four.
2013 ◽
Vol 5
◽
pp. 40-45
Keyword(s):
2017 ◽
Vol 27
(03)
◽
pp. 159-176
Keyword(s):
2002 ◽
Vol 12
(03)
◽
pp. 207-216
◽
Keyword(s):
1989 ◽
Vol 31
(1)
◽
pp. 17-20
◽
1980 ◽
Vol 2
(6)
◽
pp. 487-506
◽
2013 ◽
Vol 139
(7)
◽
pp. 697-708
◽
2014 ◽
Vol 140
(9)
◽
pp. 07014001