A fast polygon triangulation algorithm based on uniform plane subdivision
Lamot, Marko ; Žalik, Borut
A new algorithm for triangulating simple polygons is proposed. The algorithm uses a uniform space subdivision to speed-up the triangulation. The algorithm efficiently combines two approaches: an ...ear-cutting and a diagonal insertion. Comparison with the popular polygon triangulation algorithms (Sloan's ear-cutting algorithm, Seidel's randomized incremental algorithm, algorithm based on Graham scan, and Garey's et al. plane-sweep algorithm) for different classes of simple polygons (general, convex, monotone, star-shaped and the polygons taken from a GIS database) is presented. Different criteria are used for comparison: spent CPU time, quality of obtained triangulation and implementation effort. According to spent CPU time, the proposed algorithm is the most efficient among the tested algorithms for general polygons and polygons from a GIS database.
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.
