20.500.12556/DKUM-27707 Polygon trapezoidation by sets of open trapezoids A new efficient algorithm is described for the simple trapezoidation of polygons based on a sweep-line paradigm. As the sweep-line glides over the plane, a set of so-called open trapezoids is generated and maintained. It is shown that a boundary case (more polygon vertices are located on the sweep-line) can be solved safely and does not slow down the algorithm. If desired, the polygon holes can be trapezoidated simultaneously. This proposed algorithm when compared with the fastest known algorithm developed by Seidel resulted in more efficiency for different classes of polygons. polygon polygon decomposition trapezoidation computational geometry mnogokotniki deljenje mnogokotnikov trapezoidacija računalniška geometrija true false false Angleški jezik Angleški jezik Neznano 2012-06-01 12:06:25 2012-06-01 12:06:25 2022-04-15 03:45:29 2019-07-10 12:20:44 2003 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.4:514.116 8326422 0097-8493 URN:SI:UM:DK:INK4YUWH http://dx.doi.org/10.1016/S0097-8493(03)00151-1 1 https://dk.um.si/Dokument.php?lang=slv&id=37031 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0