Sciweavers

25 search results - page 2 / 5
» Size Competitive Meshing Without Large Angles
Sort
View
IMR
2003
Springer
13 years 10 months ago
Geodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Oren Sifri, Alla Sheffer, Craig Gotsman
CGI
2003
IEEE
13 years 10 months ago
An Efficient Mesh Simplification Method with Feature Detection for Unstructured Meshes and Web Graphics
This paper presents an efficient method of mesh simplification for geometric 3D models. The transmission of 3D models on the Internet is an important task. The data size of a 3D m...
Bing-Yu Chen, Tomoyuki Nishita
VISUALIZATION
2000
IEEE
13 years 9 months ago
On-the-Fly rendering of losslessly compressed irregular volume data
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
Chuan-Kai Yang, Tulika Mitra, Tzi-cker Chiueh
HIPC
2009
Springer
13 years 3 months ago
Detailed analysis of I/O traces for large scale applications
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
Nithin Nakka, Alok N. Choudhary, Wei-keng Liao, Le...
CGF
2007
98views more  CGF 2007»
13 years 5 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