A large number of simplication algorithms ( Hoppe, Garland, Rossignac, Varshaney etc.) have been published in the preceding years. However, we believe that these simplification algorithms fail to address two significant issues: topology simplification and processing degenerate polygonal models. For example, Simplification Envelepoes is a technique that offers the tightest error bounds on the ouput that it generates -- the problem is that it expects the input model to be well-behaved ( i.e. a manifold surface ). On the other hand, Vertex Clustering can process any polygonal model and simplify the geometry and topology of the surface. The drawback is that it produces low quality results. This is a conseqeunce of the fact that it uses a regular grid super-imposed on the input model to decide which polygons should be merged with other polgyons. This discretization of space leaves a signature on the output produced by this model -- the output models often contain "blocky" looking surfaces
|
Original Model
|
Volumetric Version
|
|
Morphologically Closed Volume |
Isosurface extracted from closed Volume |
Back