Sciweavers

64 search results - page 11 / 13
» Irreducible triangulations are small
Sort
View
CONEXT
2006
ACM
14 years 1 months ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack
CGF
2007
98views more  CGF 2007»
13 years 7 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
Patrick Marais, James E. Gain, D. Shreiner
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
14 years 2 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
SIGGRAPH
2010
ACM
14 years 2 days ago
Triangle surfaces with discrete equivalence classes
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
Mayank Singh, Scott Schaefer
VISUALIZATION
1997
IEEE
13 years 11 months ago
Controlled simplification of genus for polygonal models
Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively ...
Jihad El-Sana, Amitabh Varshney