Results 1  10
of
35
Fundamentals of Spherical Parameterization for 3D Meshes
 PROCEEDINGS OF THE 2006 SYMPOSIUM ON INTERACTIVE 3D GRAPHICS AND GAMES, MARCH 1417, 2006
, 2003
"... Parametrization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parametrizing a triangle mesh onto the ..."
Abstract

Cited by 104 (25 self)
 Add to MetaCart
Parametrization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parametrizing a triangle mesh onto the sphere means assigning a 3D position on the unit sphere to each of the mesh vertices, such that the spherical triangles induced by the mesh connectivity do not overlap. Satisfying the nonoverlapping requirement is the most difficult and critical component of this process. We present a generalization of the method of barycentric coordinates for planar parametrization which solves the spherical parametrization problem, prove its correctness by establishing a connection to spectral graph theory and describe efficient numerical methods for computing these parametrizations.
Mesh Parameterization: Theory and Practice
 SIGGRAPH ASIA 2008 COURSE NOTES
, 2008
"... Mesh parameterization is a powerful geometry processing tool with numerous computer graphics applications, from texture mapping to animation transfer. This course outlines its mathematical foundations, describes recent methods for parameterizing meshes over various domains, discusses emerging tools ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
Mesh parameterization is a powerful geometry processing tool with numerous computer graphics applications, from texture mapping to animation transfer. This course outlines its mathematical foundations, describes recent methods for parameterizing meshes over various domains, discusses emerging tools like global parameterization and intersurface mapping, and demonstrates a variety of parameterization applications.
Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation
, 2003
"... Abstract. We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; using a serial PC, it draws graphs of millions of node ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Abstract. We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; using a serial PC, it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is solved rapidly using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside graph drawing too.
Distributed graph layout for sensor networks
 In 12th Symposium on Graph Drawing (GD
, 2004
"... Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, lowend systems or indoor systems, which cannot use GPS, must lo ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, lowend systems or indoor systems, which cannot use GPS, must locate themselves based only on crude information available locally, such as intersensor distances. We show how a collection of sensors, capable only of measuring distances to close neighbors, can compute their locations in a purely distributed manner, i.e. where each sensor communicates only with its neighbors. This can be viewed as a distributed graph drawing algorithm. We experimentally show that our algorithm consistently produces good results under a variety of simulated realworld conditions, and is relatively robust to the presence of noise in the distance measurements.
Spectral Methods for Mesh Processing and Analysis
 EUROGRAPHICS 2007
, 2007
"... Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out desired tasks. Early works in this area can be traced back to the seminal paper by Taubin in 1995, where spectral analysis ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out desired tasks. Early works in this area can be traced back to the seminal paper by Taubin in 1995, where spectral analysis of mesh geometry based on a combinatorial Laplacian aids our understanding of the lowpass filtering approach to mesh smoothing. Over the past ten years or so, the list of applications in the area of geometry processing which utilize the eigenstructures of a variety of mesh operators in different manners have been growing steadily. Many works presented so far draw parallels from developments in fields such as graph theory, computer vision, machine learning, graph drawing, numerical linear algebra, and highperformance computing. This stateoftheart report aims to provide a comprehensive survey on the spectral approach, focusing on its power and versatility in solving geometry processing problems and attempting to bridge the gap between relevant research in computer graphics and other fields. Necessary theoretical background will be provided and existing works will be classified according to different criteria — the operators or eigenstructures employed, application domains, or the dimensionality of the spectral embeddings used — and described in adequate length. Finally, despite much empirical success, there still remain many open questions pertaining to the spectral approach, which we will discuss in the report as well.
Visualization of Labeled Data Using Linear Transformations
"... We present a novel family of datadriven linear transformations, aimed at visualizing multivariate data in a lowdimensional space in a way that optimally preserves the structure of the data. The wellstudied PCA and Fisher's LDA are shown to be special members in this family of transformations, and ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
We present a novel family of datadriven linear transformations, aimed at visualizing multivariate data in a lowdimensional space in a way that optimally preserves the structure of the data. The wellstudied PCA and Fisher's LDA are shown to be special members in this family of transformations, and we demonstrate how to generalize these two methods such as to enhance their performance. Furthermore, our technique is the only one, to the best of our knowledge, that reflects in the resulting embedding both the data coordinates and pairwise similarities and/or dissimilarities between the data elements. Even more so, when information on the clustering (labeling) decomposition of the data is known, this information can be integrated in the linear transformation, resulting in embeddings that clearly show the separation between the clusters, as well as their intrastructure. All this make our technique very flexible and powerful, and let us cope with kinds of data that other techniques fail to describe properly.
On the optimality of spectral compression of mesh data
 ACM Trans. Graph
, 2005
"... Spectral compression of the geometry of triangle meshes achieves good results in practice, but there has been little or no theoretical support for the optimality of this compression. We show that, for certain classes of geometric mesh models, spectral decomposition using the eigenvectors of the symm ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Spectral compression of the geometry of triangle meshes achieves good results in practice, but there has been little or no theoretical support for the optimality of this compression. We show that, for certain classes of geometric mesh models, spectral decomposition using the eigenvectors of the symmetric Laplacian of the connectivity graph is equivalent to principal component analysis on that class, when equipped with a natural probability distribution. Our proof treats connected oneand twodimensional meshes with fixed convex boundaries, and is based on an asymptotic approximation of the probability distribution in the twodimensional case. The key component of the proof is that the Laplacian is identical, up to a constant factor, to the inverse covariance matrix of the distribution of valid mesh geometries. Hence, spectral compression is optimal, in the mean square error sense, for these classes of meshes under some natural assumptions on their distribution.
Improved Circular Layouts
 GRAPH DRAWING
, 2006
"... Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node placement often gives rise to long edges and an overall dense drawing. We suggest here three independent, complementary tec ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node placement often gives rise to long edges and an overall dense drawing. We suggest here three independent, complementary techniques for lowering the density and improving the readability of circular layouts. First, a new algorithm is given for placing the nodes on the circle such that edge lengths are reduced. Second, we enhance the circular drawing style by allowing some of the edges to be routed around the exterior of the circle. This is accomplished with an algorithm for optimally selecting such a set of externally routed edges. The third technique reduces density by coupling groups of edges as bundled splines that share part of their route. Together, these techniques are able to reduce clutter, density and crossings compared with existing methods.
Drawing graphs by eigenvectors: Theory and practice
 Computers and Mathematics with Applications
, 2005
"... Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties from different points of view. We also suggest a novel algorithm for calculating spectral layouts resulting in an extremely fast computation by optimizing the layout within a small vector space.
On graph partitioning, spectral analysis, and digital mesh processing
 In Proc. Intl. Conf. Shape Modeling and Applications (2003
, 2003
"... Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We also elaborate on the connection between graph partitioning and spectral graph theory. Applications in computer graphics are ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We also elaborate on the connection between graph partitioning and spectral graph theory. Applications in computer graphics are described. 1.