HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2024
Title: Mesh editing with affine-invariant laplacian coordinates
Authors: Fu, Hongbo
Tai, Chiew-Lan
Keywords: Laplacian coordinate
Affine-invariant transformation
Mesh deformation
Pose-independent mesh merging
Pose-dependent mesh merging
Issue Date: Jan-2005
Series/Report no.: Computer Science Technical Report ; HKUST-CS05-01
Abstract: Differential coordinates as an intrinsic surface representation capture geometric details of surface. However, differential coordinates alone cannot achieve desirable editing results, because they are not affine invariant. In this paper, we present a novel method that makes the Laplacian coordinates completely affine-invariant during editing. For each vertex of a surface to be edited, we compute the Laplacian coordinate and implicitly define a local affine transformation that is dependent on the unknown edited vertices. During editing, both the resulting surface and the implicit local affine transformations are solved simultaneously through a constrained optimization. The underlying mathematics of our method is a set of linear Partial Differential Equations (PDEs) with a generalized boundary condition. The main computation involved comes from factorizing the resulting sparse system of linear equations, which is performed only once. After that, back substitutions are executed to interactively respond to user manipulations. We propose a new editing technique, called pose-independent merging, to demonstrate the advantages of the affine-invariant Laplacian coordinates. In the the same framework, large-scale mesh deformation and pose-dependent mesh merging are also presented.
URI: http://hdl.handle.net/1783.1/2024
Appears in Collections:CSE Technical Reports

Files in This Item:

File Description SizeFormat
tr0501.pdf1049KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.