Mesh Segmentation. Zhenyu Shu 2008.5.21 . References. Gelfand N, Guibas L J. Shape segmentation using local slippage analysis [C]. Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, Nice, France, 2004. Nice, France: ACM, 2004: 214-223.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Mesh Segmentation
Zhenyu Shu
2008.5.21
Mesh segmentation : Let M be a 3D boundary-mesh, and S the set of mesh elements which is either V, E or F. A segmentation of M is the set of sub-meshes = {M0, M1... ,Mk−1} induced by a partition of S into k disjoint sub-sets.
Gelfand, Natasha Guibas, Leonidas J
Computer Graphics Laboratory, Stanford University
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Given a surface S, we call a rigid motion M a slippable motion of S if the velocity vector of each point xS is tangent to S at x.
POTTMANN H., WALLNER J.: Computational Line Geometry. Springer Verlag, 2001.
x is a point belong to the surface S,
n is the normal at x,
r is a rotation vector around x,y,z axis,
t is translation vector.
Let X1...k and Y1...k be the small eigenvalues of Pi and Pj respectively, we just need to test if each column X1...k can be expressed as a linear combination of columns of Y1...k.
Katz, Sagi Leifman, George Tal, Ayellet
Israel Institute of Technology
The Visual Computer. 2005, 21(8): 649-658
preserve the intervals and the ratio between the dissimilarities.
preserve only the order of the dissimilarities, rather than the exact intervals and ratios.
Barlow, R., Bartholomew, D., Bremner, J., Brunk, H.: Statistical Inference Under Order Restrictions. Wiley, New York (1972)
Return
Return
Return
Podolak, Joshua; Shilane, Philip; Golovinskiy, Aleksey; Rusinkiewicz, Szymon; Funkhouser, Thomas
Princeton University
ACM SIGGRAPH 2006
f is a scalar-valued function defined over a d-dimensional space of points.
is a plane reflection.
if f is perfectly symmetric with respect to
if f is perfectly anti-symmetric with respect to
has observed that the nearest symmetric function to f is simply the average of f and
.
to smooth for the existence of small noise and small feature
Reniers, Dennie; Telea, Alexandru
Eindhoven University of Technology, The Netherlands
The Visual Computer. 2008, 24(6): 383-395
the geodesics are far
from the attachment.
Thanks