Sciweavers

498 search results - page 32 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
SIGGRAPH
2000
ACM
15 years 2 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
BMVC
1997
14 years 11 months ago
Real-time Dynamic Deformable Meshes for Volumetric Segmentation and Visualisation
This paper presents a surface segmentation method which uses a simulated inflating balloon model to segment surface structure from volumetric data using a triangular mesh. The mod...
Richard Bowden, T. A. Mitchell, M. Sahardi
MFCS
2010
Springer
14 years 8 months ago
Information Complexity of Online Problems
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
Juraj Hromkovic, Rastislav Královic, Richar...
ORDER
2010
110views more  ORDER 2010»
14 years 8 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
COMPGEOM
1994
ACM
15 years 1 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...