[100] Ivy: Bringing a Weighted-Mesh Representations to Bear on Generative Architectural Design Applications

Paper Description extracted from PDF · abstract · 149 words

Mesh segmentation has become an important and well-researched topic in computational geometry in recent years (Agathos et al. 2008). As a result, a number of new approaches have been developed that have led to innovations in a diverse set of problems in computer graphics (CG) (Shamir 2008). Specifically, a range of effective methods for the division of a mesh have recently been proposed, including by K-means (Shlafman et al. 2002), graph cuts (Golovinskiy and Funkhouser 2008; Katz and Tal 2003), hierarchical clustering (Garland et al. 2001; Gelfand and Guibas 2004; Golovinskiy and Funkhouser 2008), primitive fitting (Athene et al. 2006), random walks (Lai et al.), core extraction (Katz et al.), tubular multi-scale analysis (Mortara et al. 2004), spectral clustering (Liu and Zhang 2004), and critical point analysis (Lin et al. 2007), all of which depend upon a weighted graph representation, typically the dual of the given mesh (Shamir 2008).