Models represented by polygonal meshes have been more and more widely used in CAD/CAM systems. In sheet manufacturing industries, the flattenability of a model is very important. Prior methods for processing the flattenability of a mesh surface usually employ a constrained optimization framework, which takes the positions of all its non-boundary vertices as variables in computation. For a mesh surface with hundred thousands of vertices, solving such an optimization is very time-consuming, and may exceed the capacity of main memory. In this paper, we develop a controllable evolution method to process the flattenability of a given mesh patch. It decouples the global optimization problem into a sequence of local controllable evolution steps, each of which has only one variable. Therefore, mesh surfaces with large number of vertices can be processed.
- Design Engineering Division and Computers in Engineering Division
Flattenable Mesh Processing by Controllable Laplacian Evolution
- Views Icon Views
- Share Icon Share
- Search Site
Lin, H, Zhang, Y, Wang, CCL, & Gao, S. "Flattenable Mesh Processing by Controllable Laplacian Evolution." Proceedings of the ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 3: 30th Computers and Information in Engineering Conference, Parts A and B. Montreal, Quebec, Canada. August 15–18, 2010. pp. 275-282. ASME. https://doi.org/10.1115/DETC2010-28301
Download citation file: