Results 1  10
of
115,530
Topological Operations on Triangle Meshes Using the OpenMesh Library
"... Recent advances in acquisition and modelling techniques led to generating an exponentially increasing amount of 3D shapes available both over the Internet or in specific databases. While the number grows it becomes more and more difficult to keep an organized knowledge over the content of this repos ..."
Abstract
 Add to MetaCart
to have tools for automatic characterization of 3D shapes, and skeletons and partitions are the two most prominent ones among them. In this paper we will describe an experience of building some of this tools on the top of a popular and robust library for manipulating meshes (OpenMesh). The preliminary
OpenMesh  a generic and efficient polygon mesh data structure
, 2002
"... We describe the implementation of a halfedge data structure for the static representation and dynamic handling of arbitrary polygonal meshes. The particular design of the data structures and classes aims at maximum flexibility and high performance. We achieve this by using generative programming co ..."
Abstract

Cited by 47 (5 self)
 Add to MetaCart
We describe the implementation of a halfedge data structure for the static representation and dynamic handling of arbitrary polygonal meshes. The particular design of the data structures and classes aims at maximum flexibility and high performance. We achieve this by using generative programming
OpenMesh  a generic and efficient polygon mesh data structure
 In OpenSG Symposium
, 2002
"... We describe the implementation of a halfedge data structure for the static representation and dynamic handling of arbitrary polygonal meshes. The particular design of the data structures and classes aims at maximum flexibility and high performance. We achieve this by using generative programming co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe the implementation of a halfedge data structure for the static representation and dynamic handling of arbitrary polygonal meshes. The particular design of the data structures and classes aims at maximum flexibility and high performance. We achieve this by using generative programming
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 303 (25 self)
 Add to MetaCart
triangle to an adjacent one. At each stage, compression produces an opcode describing the topological relation between the current triangle and the boundary of the remaining part of the mesh. Decompression uses these opcodes to reconstruct the entire incidence graph. Because Edgebreaker’s compression
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 553 (24 self)
 Add to MetaCart
fidelity computer graphics objects using imperfectlymeasured data from the real world. Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large timesteps; a scaledependent Laplacian operator to improve the diffusion process; and finally, a robust
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 397 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
and progressively displaying these meshes that combines a multiresolution hierarchy based on bounding spheres with a rendering system based on points. A single data structure is used for view frustum culling, backface culling, levelofdetail selection, and rendering. The representation is compact and can
Using spin images for efficient object recognition in cluttered 3D scenes
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1999
"... We present a 3D shapebased object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spinimage representation. The spinimage is a data level shape descriptor that i ..."
Abstract

Cited by 571 (9 self)
 Add to MetaCart
that is used to match surfaces represented as surface meshes. We present a compression scheme for spinimages that results in efficient multiple object recognition which we verify with results showing the simultaneous recognition of multiple objects from a library of 20 models. Furthermore, we demonstrate
Discrete DifferentialGeometry Operators for Triangulated 2Manifolds
, 2002
"... This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Vorono ..."
Abstract

Cited by 453 (17 self)
 Add to MetaCart
This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a new centrality measure that identifies those vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of realworld complex networks.
Results 1  10
of
115,530