Efficient view sphere tessellation method based on halfedge data structure and quadtree

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 365
  • Download : 0
In this paper, we propose a new view sphere tessellation method based on the modified halfedge data structure and quadtree. Algorithms that tessellate the view sphere into arbitrarily shaped views, efficiently access a viewpoint and find the neighbor viewpoints for the 3-D multiview representation are presented.
Publisher
Elsevier BV
Issue Date
1993-09
Language
English
Article Type
Article
Keywords

RECOGNIZING 3-D OBJECTS; COMPUTER VISION; RECOGNITION; INFORMATION; MODELS; IMAGES

Citation

COMPUTERS & GRAPHICS , v.17, no.5, pp.575 - 581

ISSN
0097-8493
URI
http://hdl.handle.net/10203/65710
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0