We introduce AniMesh, a system that supports interleaved modeling and animation creation and edit... more We introduce AniMesh, a system that supports interleaved modeling and animation creation and editing. AniMesh is suitable for rapid prototyping and easily accessible to non-experts. Source animations can be obtained from commodity motion capture devices or by adapting canned motion sequences. We propose skeleton abstraction and motion retargeting algorithms for finding correspondences and transferring motion between skeletons, or portions of skeletons, with varied topology. Motion can be copied-and-pasted between kinematic chains with different skeletal topologies, and entire model parts can be cut and reattached, while always retaining plausible, composite animations.
We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a par... more We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum, in the domain, and the gradient of the function on the boundary points inward. Because every integral curve intersects the boundary exactly once, Integral Curve Coordinates provide a natural bijective mapping from one domain to another given a bijection of the boundary. Our approach can be applied to shapes in any dimension, provided that the boundary of the shape (or cage) is topologically equivalent to an $n$-sphere. We present a simple algorithm for generating a suitable function space for $f$ in any dimension. We demonstrate our approach in 2D and describe a practical (simple and robust) algorithm for tracing integral curves on a (piecewise-linear) triangulated regular grid.
We study a family of compactifications of the complex plane that distinguishes among the values o... more We study a family of compactifications of the complex plane that distinguishes among the values of positive infinity, negative infinity, and other "arguments" of infinity. We augment the complex plane with an ideal set of points on an ideal circle. Each point on this circle corresponds to a dier- ent ray in the complex plane emanating from the origin. In this manner we obtain the "ultra extended complex plane." The set of points in the ultra extended complex plane maps to a bowl-shaped subset of the Riemann sphere via a certain projection. We obtain the Riemann stereographic projection as a degenerate limit of a family of projections. Thus, we demonstrate how the infinitely many dierent directions at infinity degenerate into a single ideal point at infinity that is added to R2 in order to produce the extended complex plane. The features of this mapping are studied; the introduction of a metric on the ultra extended complex plane is a focal subject of this paper.
It is well established that in certain domains, noisy inputs can be reliably combined to obtain a... more It is well established that in certain domains, noisy inputs can be reliably combined to obtain a better answer than any individual. It is now possible to consider the crowdsourc-ing of physical actions, commonly used for creative expres-sions such as drawing, shading, and singing. We provide al-gorithms for converting low-quality input obtained from the physical actions of a crowd into high-quality output. The inputs take the form of line drawings, shaded images, and songs. We investigate single-individual crowds (multiple in-puts from a single human) and multiple-individual crowds.
Many common objects have highly reflective metallic or painted finishes. Their appearance is prim... more Many common objects have highly reflective metallic or painted finishes. Their appearance is primarily defined by the distortion the curved shape of the surface introduces in the reflections of surrounding objects. Reflection lines are commonly used for surface interrogation, as they capture many essential aspects of reflection distortion directly, and clearly show surface imperfections that may be hard to see
We present an automatic method that can be used to abstract high resolution images into very low ... more We present an automatic method that can be used to abstract high resolution images into very low resolution outputs with reduced color palettes in the style of pixel art. Our method simultaneously solves for a mapping of features and a reduced palette needed to construct the output image. The results are an approximation to the results generated by pixel artists.
We introduce AniMesh, a system that supports interleaved modeling and animation creation and edit... more We introduce AniMesh, a system that supports interleaved modeling and animation creation and editing. AniMesh is suitable for rapid prototyping and easily accessible to non-experts. Source animations can be obtained from commodity motion capture devices or by adapting canned motion sequences. We propose skeleton abstraction and motion retargeting algorithms for finding correspondences and transferring motion between skeletons, or portions of skeletons, with varied topology. Motion can be copied-and-pasted between kinematic chains with different skeletal topologies, and entire model parts can be cut and reattached, while always retaining plausible, composite animations.
We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a par... more We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum, in the domain, and the gradient of the function on the boundary points inward. Because every integral curve intersects the boundary exactly once, Integral Curve Coordinates provide a natural bijective mapping from one domain to another given a bijection of the boundary. Our approach can be applied to shapes in any dimension, provided that the boundary of the shape (or cage) is topologically equivalent to an $n$-sphere. We present a simple algorithm for generating a suitable function space for $f$ in any dimension. We demonstrate our approach in 2D and describe a practical (simple and robust) algorithm for tracing integral curves on a (piecewise-linear) triangulated regular grid.
We study a family of compactifications of the complex plane that distinguishes among the values o... more We study a family of compactifications of the complex plane that distinguishes among the values of positive infinity, negative infinity, and other "arguments" of infinity. We augment the complex plane with an ideal set of points on an ideal circle. Each point on this circle corresponds to a dier- ent ray in the complex plane emanating from the origin. In this manner we obtain the "ultra extended complex plane." The set of points in the ultra extended complex plane maps to a bowl-shaped subset of the Riemann sphere via a certain projection. We obtain the Riemann stereographic projection as a degenerate limit of a family of projections. Thus, we demonstrate how the infinitely many dierent directions at infinity degenerate into a single ideal point at infinity that is added to R2 in order to produce the extended complex plane. The features of this mapping are studied; the introduction of a metric on the ultra extended complex plane is a focal subject of this paper.
It is well established that in certain domains, noisy inputs can be reliably combined to obtain a... more It is well established that in certain domains, noisy inputs can be reliably combined to obtain a better answer than any individual. It is now possible to consider the crowdsourc-ing of physical actions, commonly used for creative expres-sions such as drawing, shading, and singing. We provide al-gorithms for converting low-quality input obtained from the physical actions of a crowd into high-quality output. The inputs take the form of line drawings, shaded images, and songs. We investigate single-individual crowds (multiple in-puts from a single human) and multiple-individual crowds.
Many common objects have highly reflective metallic or painted finishes. Their appearance is prim... more Many common objects have highly reflective metallic or painted finishes. Their appearance is primarily defined by the distortion the curved shape of the surface introduces in the reflections of surrounding objects. Reflection lines are commonly used for surface interrogation, as they capture many essential aspects of reflection distortion directly, and clearly show surface imperfections that may be hard to see
We present an automatic method that can be used to abstract high resolution images into very low ... more We present an automatic method that can be used to abstract high resolution images into very low resolution outputs with reduced color palettes in the style of pixel art. Our method simultaneously solves for a mapping of features and a reduced palette needed to construct the output image. The results are an approximation to the results generated by pixel artists.
Uploads
Papers by Yotam Gingold