Results 1  10
of
49,893
Geometric Fairing of Irregular Meshes using Mesh Hierarchies
"... this paper is defined as #BH = 0, (1) which can be interpreted as one possible nonlinear analogon to thin plate splines. Here #B is the Laplace Beltrami operator and H the mean curvature. The PDE only depends on geometric intrinsics and is comparatively simple for a forth order equation. Because of ..."
Abstract
 Add to MetaCart
this paper is defined as #BH = 0, (1) which can be interpreted as one possible nonlinear analogon to thin plate splines. Here #B is the Laplace Beltrami operator and H the mean curvature. The PDE only depends on geometric intrinsics and is comparatively simple for a forth order equation. Because of the mean value property of the Laplacian, it is guaranteed that the extremal mean curvature values of a solution of (1) will be reached at the border and that there are no local extrema in the interior. Since constant mean curvature surfaces satisfy this equation, important basic shapes as spheres, cylinders and minimal surfaces satisfying H = 0 can be reconstructed
Truly Selective Polygonal Mesh Hierarchies with Error Control
, 2005
"... In this work a new multiresolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the twosided ..."
Abstract
 Add to MetaCart
sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non triangulated polygonal models. As most dependencies in the hierarchy are in the form of trees, the resulting representation is very compact and allows for a compressed incore representation. Furthermore
Multiresolution Analysis of Arbitrary Meshes
, 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract

Cited by 605 (16 self)
 Add to MetaCart
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit
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
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh
, 2003
"... In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes selforganize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burd ..."
Abstract

Cited by 424 (23 self)
 Add to MetaCart
burden on the underlying network. In this paper, we target highbandwidth data distribution from a single source to a large number of receivers. Applications include largefile transfers and realtime multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can
1SelfOrganization of a Mesh Hierarchy for Smart Grid Monitoring in Outage Scenarios
"... Abstractâ€”Current hierarchical communication infrastructure in the smart grid is not robust for data collection from smart meters during outages. In this work, we propose a selforganizing multichannel wireless communication framework to aid in data collection for smart grid health monitoring. We pr ..."
Abstract
 Add to MetaCart
propose a twostage bootstrapping process in which nodes first selforganize into local mesh clusters by flattening the provisioned hierarchy and then interconnect to provide mesh connectivity from the outage region to functioning regions of the grid. We propose to construct this meshofmeshes hierarchy
A Fast Algorithm for Particle Simulations
, 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract

Cited by 1145 (19 self)
 Add to MetaCart
this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions are Coulombic or gravitational in nature. For a the form system of N particles, an amount of work of the order O(N 2 ) has traditionally been required to evaluate all pairwise interactions, un F5F far 1 (F near 1F external ), less some approximation or truncation method is used. The algorithm of the present paper requires an amount of work proportional to N to evaluate all interactions to within roundoff error, making it where F near (when present) is a rapidly decaying potential con
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data deliv ..."
Abstract

Cited by 719 (21 self)
 Add to MetaCart
We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data delivery trees with desirable properties. We present extensive simulations of both our protocol and the Narada applicationlayer multicast protocol over Internetlike topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25%), improved or similar endtoend latencies and similar failure recovery properties. More importantly, it is able to achieve these results by using orders of magnitude lower control traffic. Finally, we present results from our widearea testbed in which we experimented with 32100 member groups distributed over 8 different sites. In our experiments, averagegroup members established and maintained lowlatency paths and incurred a maximum packet loss rate of less than 1 % as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.
Realtime human pose recognition in parts from single depth images
 In In CVPR, 2011. 3
"... We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler p ..."
Abstract

Cited by 550 (19 self)
 Add to MetaCart
We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler perpixel classification problem. Our large and highly varied training dataset allows the classifier to estimate body parts invariant to pose, body shape, clothing, etc. Finally we generate confidencescored 3D proposals of several body joints by reprojecting the classification result and finding local modes. The system runs at 200 frames per second on consumer hardware. Our evaluation shows high accuracy on both synthetic and real test sets, and investigates the effect of several training parameters. We achieve state of the art accuracy in our comparison with related work and demonstrate improved generalization over exact wholeskeleton nearest neighbor matching. 1.
Results 1  10
of
49,893