1% 0% Figure 1: A smooth 4-PolyVector field is generated from a sparse set of principal direction constraints (faces in light blue). We optimize the field for conjugacy and use it to guide the generation of a planar-quad mesh. Pseudocolor represents planarity. AbstractWe introduce N-PolyVector fields, a generalization of N-RoSy fields for which the vectors are neither necessarily orthogonal nor rotationally symmetric. We formally define a novel representation for N-PolyVectors as the root sets of complex polynomials and analyze their topological and geometric properties. A smooth N-PolyVector field can be efficiently generated by solving a sparse linear system without integer variables. We exploit the flexibility of N-PolyVector fields to design conjugate vector fields, offering an intuitive tool to generate planar quadrilateral meshes.

We present a framework for designing curl-free tangent vector fields on discrete surfaces. Such vector fields are gradients of locally-defined scalar functions, and this property is beneficial for creating surface parameterizations, since the gradients of the parameterization coordinate functions are then exactly aligned with the designed fields. We introduce a novel definition for discrete curl between unordered sets of vectors (PolyVectors), and devise a curl-eliminating continuous optimization that is independent of the matchings between them. Our algorithm naturally places the singularities required to satisfy the user-provided alignment constraints, and our fields are the gradients of an inversion-free parameterization by design.

SummaryDirection fields and vector fields play an increasingly important role in computer graphics and geometry processing. The synthesis of directional fields on surfaces, or other spatial domains, is a fundamental step in numerous applications, such as mesh generation, deformation, texture mapping, and many more. The wide range of applications resulted in definitions for many types of directional fields: from vector and tensor fields, over line and cross fields, to frame and vector-set fields. Depending on the application at hand, researchers have used various notions of objectives and constraints to synthesize such fields. These notions are defined in terms of fairness, feature alignment, symmetry, or field topology, to mention just a few. To facilitate these objectives, various representations, discretizations, and optimization strategies have been developed. These choices come with varying strengths and weaknesses. This course provides a systematic overview of directional field synthesis for graphics applications, the challenges it poses, and the methods developed in recent years to address these challenges. PrerequisitesThe audience should have some prior experience with triangle mesh representation of geometric models, and a working knowledge of vector calculus, linear algebra, and general computer graphics fundamentals. Some familiarity with the basics of differential geometry and numerical optimization are helpful, but not required. Intended AudienceThe course targets researchers and developers who seek to understand the concepts and technologies used in direction field and vector field synthesis, learn about the most recent developments, and discern how this powerful tool, which has had impact in a variety of research and application areas, might benefit their area of work. Participants will get a broad overview, and obtain the knowledge on how to choose the proper combination of techniques for many relevant tasks. SourcesThese notes are largely based on the following state-of-the-art report by the lecturers. It has been extended to include updates on the most recent developments. • The course was subsequently given at SIGGRAPH Asia 2016, including demos and real-time coding sessions. The entire course, including the notes, the presentation slides, and the demos, is provided in the following open-source GitHub repository: https://github.com/avaxman/DirectionalFieldSynthesis Further ReadingBeing a relatively young and developing topic, no textbooks covering the various aspects of directional field synthesis in the context of computer graphics and geometry processing are available. The notes of a recent course on vector field processing offer another perspective on parts of the topic, with a focus on the discrete differential geometry aspects:• F. Her current interests are in geometry processing and modeling, specifically on vector field design, surface parametrizations, and inter-surface mappings. David Bommes RWTH Aachen University, GermanyDavid Bommes is an assistant professor in the Computer Science ...

We consider the problem of generalizing affine combinations in Euclidean spaces to triangle meshes: computing weighted averages of points on surfaces. We address both the forward problem , namely computing an average of given anchor points on the mesh with given weights, and the inverse problem , which is computing the weights given anchor points and a target point. Solving the forward problem on a mesh enables applications such as splines on surfaces, Laplacian smoothing and remeshing. Combining the forward and inverse problems allows us to define a correspondence mapping between two different meshes based on provided corresponding point pairs, enabling texture transfer, compatible remeshing, morphing and more. Our algorithm solves a single instance of a forward or an inverse problem in a few microseconds. We demonstrate that anchor points in the above applications can be added/removed and moved around on the meshes at interactive framerates, giving the user an immediate result as feedback.

SummaryDirection fields and vector fields play an increasingly important role in computer graphics and geometry processing. The synthesis of directional fields on surfaces, or other spatial domains, is a fundamental step in numerous applications, such as mesh generation, deformation, texture mapping, and many more. The wide range of applications resulted in definitions for many types of directional fields: from vector and tensor fields, over line and cross fields, to frame and vector-set fields. Depending on the application at hand, researchers have used various notions of objectives and constraints to synthesize such fields. These notions are defined in terms of fairness, feature alignment, symmetry, or field topology, to mention just a few. To facilitate these objectives, various representations, discretizations, and optimization strategies have been developed. These choices come with varying strengths and weaknesses. This course provides a systematic overview of directional field synthesis for graphics applications, the challenges it poses, and the methods developed in recent years to address these challenges. PrerequisitesThe audience should have some prior experience with triangle mesh representation of geometric models, and a working knowledge of vector calculus, linear algebra, and general computer graphics fundamentals. Some familiarity with the basics of differential geometry and numerical optimization are helpful, but not required. Intended AudienceThe course targets researchers and developers who seek to understand the concepts and technologies used in direction field and vector field synthesis, learn about the most recent developments, and discern how this powerful tool, which has had impact in a variety of research and application areas, might benefit their area of work. Participants will get a broad overview, and obtain the knowledge on how to choose the proper combination of techniques for many relevant tasks. SourcesThese notes are largely based on the following state-of-the-art report by the lecturers. It has been extended to include updates on the most recent developments. • The course was subsequently given at SIGGRAPH Asia 2016, including demos and real-time coding sessions. The entire course, including the notes, the presentation slides, and the demos, is provided in the following open-source GitHub repository: https://github.com/avaxman/DirectionalFieldSynthesis Further ReadingBeing a relatively young and developing topic, no textbooks covering the various aspects of directional field synthesis in the context of computer graphics and geometry processing are available. The notes of a recent course on vector field processing offer another perspective on parts of the topic, with a focus on the discrete differential geometry aspects:• F. Her current interests are in geometry processing and modeling, specifically on vector field design, surface parametrizations, and inter-surface mappings. David Bommes RWTH Aachen University, GermanyDavid Bommes is an assistant professor in the Computer Science ...