ABSTRACT
Obtaining compact geometric representations of complex shapes is critical to performing efficient operations on geometric data in computer graphics and computational geometry. Operations commonly performed on geometric data include compression, animation, and rendering. One effective method for compactly representing geometric data is to subdivide the data into parts that can themselves be represented efficiently. It is often desirable to divide a
CONTENTS
9.1 Introduction ................................................................................................. 239 9.2 Controlling Self-Affine Clouds Using QBCs .......................................... 242
9.2.1 Fundamentals of Curves and IFSs ............................................... 242 9.2.1.1 Quadratic Bézier Curves ................................................ 242 9.2.1.2 Iterated Function Systems .............................................. 243
9.2.2 An IFS with a QBC Attractor ........................................................ 244 9.2.2.1 IFSs with QBC Attractors ............................................... 246 9.2.2.2 Controlling IFS Clouds with QBCs ............................... 248
9.3 Tooth-Shape Segmentation........................................................................ 251 9.3.1 Bottom-Up Clustering .................................................................... 251 9.3.2 Top-Down Clustering .................................................................... 252 9.3.3 Watershed Segmentation ...............................................................253 9.3.4 Lloyd’s Algorithm ...........................................................................255
