DOI: 10.14711/thesis-b987538
|View full text |Cite
|
Sign up to set email alerts
|

Differential techniques for scalable and interactive mesh editing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…However, different from most existing energy-minimization type algorithms that depend on traditional heuristic search methods such as the Newton's method or Genetic Algorithm, our algorithm formulates the minimization as a continuous shape deformation process that starts from some developable mesh surface (e.g., a planar figure) and ends on the final mesh surface that satisfies both the interpolation and developability requirements. Our algorithm is motivated by recent progress in mesh editing that employs the Laplacian operator [3], [4]. In a mesh editing environment that relies on the Laplacian operation, a mesh surface is continuously deformed, while the Laplacian coordinates at all the vertices are being preserved as much as possible (see Fig.…”
mentioning
confidence: 99%
“…However, different from most existing energy-minimization type algorithms that depend on traditional heuristic search methods such as the Newton's method or Genetic Algorithm, our algorithm formulates the minimization as a continuous shape deformation process that starts from some developable mesh surface (e.g., a planar figure) and ends on the final mesh surface that satisfies both the interpolation and developability requirements. Our algorithm is motivated by recent progress in mesh editing that employs the Laplacian operator [3], [4]. In a mesh editing environment that relies on the Laplacian operation, a mesh surface is continuously deformed, while the Laplacian coordinates at all the vertices are being preserved as much as possible (see Fig.…”
mentioning
confidence: 99%