Sciweavers

167 search results - page 3 / 34
» Mesh Generation and Refinement of Polygonal Data Sets
Sort
View
3DIM
2005
IEEE
14 years 1 months ago
Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
Peiran Liu, Xiaojun Shen, Nicolas D. Georganas, Ge...
COMPGEOM
2009
ACM
14 years 1 months ago
Quadrilateral meshes with bounded minimum angle
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ra...
CGF
2010
153views more  CGF 2010»
13 years 7 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
SIGGRAPH
2000
ACM
13 years 11 months ago
QSplat: a multiresolution point rendering system for large meshes
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
Szymon Rusinkiewicz, Marc Levoy
IMR
2004
Springer
14 years 24 days ago
Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
Yasushi Ito, Alan M. Shih, Bharat K. Soni