Sciweavers

Share
CGF
2008
153views more  CGF 2008»
9 years 5 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
IDMS
1997
Springer
153views Multimedia» more  IDMS 1997»
9 years 9 months ago
Embedding Data in 3D Models
The recent popularity of digital media such as CD-ROM and the Internet has prompted exploration of techniques for embedding data, either visibly or invisibly, into text, image, and...
Ryutarou Ohbuchi, Hiroshi Masuda, Masaki Aono
VISUALIZATION
1998
IEEE
9 years 10 months ago
Fast and memory efficient polygonal simplification
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
Peter Lindstrom, Greg Turk
VISUALIZATION
2002
IEEE
9 years 10 months ago
PMR: Point to Mesh Rendering, A Feature-Based Approach
Within the field of computer graphics and visualization, it is often necessary to visualize polygonal models with large number of polygons. Display quality is mandatory, but it i...
Tamal K. Dey, James Hudson
WWW
2001
ACM
10 years 6 months ago
A Search Engine for Polygonal Models to Support Development of 3D E-Learning Applications
We have developed a web-based search engine for 3D polygonal models. These days, the number of web sites using Web 3D technology is increasing. The development of our search engin...
Motofumi T. Suzuki
books