Sciweavers

876 search results - page 105 / 176
» Complexity in geometric SINR
Sort
View
ICIP
2005
IEEE
14 years 11 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
GMP
2006
IEEE
127views Solid Modeling» more  GMP 2006»
14 years 4 months ago
Finding All Undercut-Free Parting Directions for Extrusions
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
Xiaorui Chen, Sara McMains
IMR
2004
Springer
14 years 3 months ago
Finite Element Mesh Sizing for Surfaces Using Skeleton
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
SIGGRAPH
1993
ACM
14 years 2 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan