Sciweavers

346 search results - page 28 / 70
» On the sizes of Delaunay meshes
Sort
View
EWC
2006
120views more  EWC 2006»
13 years 7 months ago
A comparison of two optimization methods for mesh quality improvement
We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measure...
Lori Freitag Diachin, Patrick M. Knupp, Todd S. Mu...
VISUALIZATION
2000
IEEE
13 years 12 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
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
MIG
2010
Springer
13 years 6 months ago
Navigation Queries from Triangular Meshes
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
Marcelo Kallmann
FSTTCS
2000
Springer
13 years 11 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen