|
Quadric Based Surface
Segmentation
We present a new mesh segmentation method by fitting quadric
surfaces in a variational optimization framework. We use
consistent energy minimization to cluster faces of mesh into
separate quadratic patches iteratively. A new error metric for
quadric surface is devised instead of using the time consuming
exact L2 metric. Acceleration techniques are also proposed for
models with salient features and large size. The convergent
behavior of the proposed method is analyzed systematically.
  
Variational
3D Shape Segmentation
We propose a variational approach to computing an optimal
segmentation of a 3D shape for computing a union of tight bounding
volumes. Based on an affine invariant measure of e-tightness, the
resemblance to ellipsoid, a novel functional is formulated that governs
an optimization process to obtain a partition with multiple components.
Refinement of segmentation is driven by application-specific error
measures, so that the final bounding volume meets pre-specified user
requirement. Our method works well for computing ellipsoidal bounding
volumes as well as oriented bounding boxes.
   
Publications and Technical Reports
D.M. Yan, Y. Liu and W. Wang,
Quadric Surface Extraction by Variational Shape Approximation,
Geometric Modeling and Processing - GMP 2006: 4th
International Conference, Pittsburgh, PA, USA, July 26-28, 2006,
73 - 86. [pdf]
[Errata]
L. Lu, Y.K. Choi, W. Wang and M-S Kim,
Variational 3D Shape Segmentation for Bounding Volume
Computation, Computer Graphics Forum 26(3),
EuroGraphics 2007, 329-338. [pdf]
|
