Quaternion Julia Set Shape Optimization
dc.contributor.author | Kim, Theodore | en_US |
dc.contributor.editor | Mirela Ben-Chen and Ligang Liu | en_US |
dc.date.accessioned | 2015-07-06T05:00:58Z | |
dc.date.available | 2015-07-06T05:00:58Z | |
dc.date.issued | 2015 | en_US |
dc.description.abstract | We present the first 3D algorithm capable of answering the question: what would a Mandelbrot-like set in the shape of a bunny look like? More concretely, can we find an iterated quaternion rational map whose potential field contains an isocontour with a desired shape? We show that it is possible to answer this question by casting it as a shape optimization that discovers novel, highly complex shapes. The problem can be written as an energy minimization, the optimization can be made practical by using an efficient method for gradient evaluation, and convergence can be accelerated by using a variety of multi-resolution strategies. The resulting shapes are not invariant under common operations such as translation, and instead undergo intricate, non-linear transformations. | en_US |
dc.description.number | 5 | en_US |
dc.description.sectionheaders | Numerical Methods for Geometry Processing | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 34 | en_US |
dc.identifier.doi | 10.1111/cgf.12705 | en_US |
dc.identifier.pages | 167-176 | en_US |
dc.identifier.uri | https://doi.org/10.1111/cgf.12705 | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.subject | I.3.5 [Computer Graphics] | en_US |
dc.subject | Computational Geometry and Object Modeling | en_US |
dc.subject | Curve | en_US |
dc.subject | surface | en_US |
dc.subject | solid | en_US |
dc.subject | and object representations | en_US |
dc.title | Quaternion Julia Set Shape Optimization | en_US |