Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
