Intuitive Change of 3D Wand Function in Surface Design
VMR '09 Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009
Low-Overhead 3D Items Drawing Engine for Communicating Situated Knowledge
AMT '09 Proceedings of the 5th International Conference on Active Media Technology
Drawing with the Flow: a sketch-based interface for illustrative visualization of 2D vector fields
Proceedings of the Seventh Sketch-Based Interfaces and Modeling Symposium
OverCoat: an implicit canvas for 3D painting
ACM SIGGRAPH 2011 papers
3D spatial interaction: applications for art, design, and science
ACM SIGGRAPH 2011 Courses
Mockup builder: direct 3D modeling on and above the surface in a continuous interaction space
Proceedings of Graphics Interface 2012
SBM'08 Proceedings of the Fifth Eurographics conference on Sketch-Based Interfaces and Modeling
Authoring and animating painterly characters
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
Stretch-free surface flattening has been requested by a variety of applications. At present, the most difficult problem is how to segment a given model into nearly developable atlases so that a nearly stretch-free flattening can be computed. The criterion for segmentation is needed to evaluate the possibility of flattening a given surface patch, which should be fast computed. In this paper, we present a method to compute the length-preserved free boundary (LPFB) of a mesh patch, which speeds up the mesh parameterization. The distortion on parameterization can then be employed as the criterion in a trial-and-error algorithm for segmenting a given model into nearly developable atlases. The computation of LPFB is formulated as a numerical optimization problem in the angle space, where we are trying to optimize the angle excesses on the boundary while preserving the constraints derived from the closed-path theorem and the length preservation.