Sciweavers

85 search results - page 12 / 17
» Combinatorial algorithms for fast clock mesh optimization
Sort
View
IMR
2004
Springer
14 years 1 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
MOBICOM
2005
ACM
14 years 1 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal
24
Voted
CG
2007
Springer
13 years 7 months ago
Temporal wavelet-based compression for 3D animated models
We present an efficient compression scheme for animated sequences of triangular meshes of the same connectivity. The proposed algorithm exploits the temporal coherence of the geo...
Frédéric Payan, Marc Antonini
IMR
2004
Springer
14 years 1 months ago
Intuitive, Interactive, and Robust Modification and Optimization of Finite Element Models
Virtual prototyping and numerical simulations are increasingly replacing real mock-ups and experiments in industrial product development. Many of these simulations, e.g. for the p...
Katrin Bidmon, Dirc Rose, Thomas Ertl
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 8 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano