On visual complexity of 3D shapes
โ Scribed by Waqar Saleem; Alexander Belyaev; Danyi Wang; Hans-Peter Seidel
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 551 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0097-8493
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Binary pyramids in two and three dimensions can be used for multiresolution representation. The "standard" OR and AND pyramids have serious drawbacks, as they distort the shape significantly; therefore they can seldom be used effectively. Here we present alternative approaches to build binary pyrami
Similarity-based retrieval from databases of isolated visual shapes has become an important information retrieval problem. The goal of the current work is to achieve high retrieval speed with reasonable retrieval effectiveness, and support for partial and occluded shape queries. In the proposed meth
A measure of compactness for 3D (three dimensional) shapes composed of voxels, is presented. The work proposed here improves and extends to the measure o/discrete compactness [1] from 2D (two dimensional) domain to 3D. The measure of discrete compactness proposed here corresponds to the sum of the c