Decomposition of simple polygons is one of the major tasks in the computational geometry and its applications. The most researched polygon decomposition is a polygon triangulation. Polygon ...tringulation algorithms can be classified into three groups: algorithms based on diagonal inserting, algorithms based on Delauny triangulation and algoritms using Steiner points. The paper explains the most important algorithms from each group and summarizes the common features of the groups. After that four algorithms based on diagonals insertion are compared: a recursive diagonal algorithm, an ear cutting algorithm, Kong's Graham Scan algorithm, and Siedl's randomized incremental algorithm. Attributes for comparison are: speed, the quality of output triangles and the ability of the algorithm to handle polygons with holes.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
