Sciweavers

713 search results - page 25 / 143
» Laplacian mesh optimization
Sort
View
SIGGRAPH
1996
ACM
13 years 11 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe
GRAPHICSINTERFACE
2007
13 years 9 months ago
Stretch-based tetrahedral mesh manipulation
We present a novel least scaling distortion metric to measure the deformation distortion for tetrahedral meshes. The stretch-like metric is a combination of Jacobian matrix norm a...
Wenhao Song, Ligang Liu
COMGEO
2006
ACM
13 years 7 months ago
On the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
Siu-Wing Cheng
ICC
2007
IEEE
200views Communications» more  ICC 2007»
14 years 1 months ago
Joint Resource Allocation and Routing for OFDMA-Based Broadband Wireless Mesh Networks
— In this paper, we investigate joint resource allocation and routing for a wireless mesh network consisting of fixed access points inter-connected through multi-channel wireles...
Kemal Karakayali, Joseph H. Kang, Murali S. Kodial...
IMR
2004
Springer
14 years 28 days ago
A Comparison of Inexact Newton and Coordinate Descent Mesh Optimization Techniques
We compare inexact Newton and coordinate descent methods for optimizing the quality of a mesh by repositioning the vertices, where quality is measured by the harmonic mean of the ...
Lori Freitag Diachin, Patrick M. Knupp, Todd S. Mu...