June 1995
Intermediate to advanced
438 pages
10h 53m
English
Narkhede Atul and Dinesh Manocha manocha@cs.unc.edu, Department of Computer Science University of North Carolina Chapel Hill, North Carolina; Department of Computer Science University of North Carolina Chapel Hill, North Carolina. E-mail address: narkhede@cs.unc.edu
Computing the triangulation of a polygon is a fundamental algorithm in computational geometry. In computer graphics, polygon triangulation algorithms are widely used for tessellating curved geometries, such as those described by splines (Kumar and Manocha 1994). Methods of triangulation include greedy algorithms (O’Rourke 1994), convex hull differences (Tor and Middleditch 1984) and horizontal decompositions ...
Read now
Unlock full access