A topology-preserving polygonal simplification using vertex clustering

  • Authors:

  • Takayuki Kanaya;Yuji Teshima;Ken-ichi Kobori;Koji Nishio

  • Affiliations:

  • Hiroshima International University;Shizuoka Institute of Science and Technology;Osaka Institute of Technology;Osaka Institute of Technology

  • Venue:
  • GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Product developers have used a lot of polygon data, approximated from 3D-CAD data, as a collaboration tool on the Internet. It is difficult to deal with this data for example with respect to transmission, computational cost, or rendering, so simplification algorithms are required for data compression. In general, a vertex-clustering algorithm in simplification algorithms is very fast, although it has the problem that topology information is not preserved and for some applications, such as 3D-CAD, it is important to preserve topology information. We define topology information in this paper as genus on the polyhedron and 2-manifold. In this paper, we propose a topology-preserving simplification method using a depth-first search tree on a vertex-clustering algorithm. Our method does not lose the advantage that vertex-clustering algorithms are fast yet it solves the problem of lost topology information. Experimental results show that this method is effective and is easily adapted to space division algorithms of other vertex-clustering algorithms