Entity

Time filter

Source Type


Huang Z.,University of Science and Technology of China | Huang Z.,Key Laboratory of Software in Computing and Communication | Huang Z.,A+ Network | Wang G.,Peking University
CAD Computer Aided Design | Year: 2011

This paper presents a generalization of CatmullClark-variant DooSabin surfaces and non-uniform biquadratic B-spline surfaces called Non-Uniform Recursive DooSabin Surfaces (NURDSes). One step of NURDS refinement can be factored into one non-uniform linear subdivision step plus one dual step. Compared to the prior non-uniform DooSabin surfaces (i.e., quadratic NURSSes), NURDSes are convergent for arbitrary n-sided faces. Closed form limit point rules, which are important for applications in adaptive rendering and NC machining, are given as well. © 2011 Elsevier Ltd. All rights reserved. Source


Huang Z.,University of Science and Technology of China | Huang Z.,Key Laboratory of Software in Computing and Communication | Huang Z.,A+ Network | Wang F.,University of Science and Technology of China | And 3 more authors.
Journal of Information and Computational Science | Year: 2011

In this paper we propose a modification of quadratic NURSSes called EDSes (Extended Doo-Sabin Surfaces). EDSes inherit the refinement rules for quadratic NURSSes for four-sided faces but use the refinement rules for Doo-Sabin surfaces for faces with other than four sides. Compared to quadratic NURSSes, if all the knot intervals are positive, EDSes always converge to G1 continuous limit surfaces with closed-form limit point as well as limit normal rules. 1548-7741/Copyright © 2011 Binary Information Press. Source


Huang L.,Hefei University of Technology | Huang L.,Key Laboratory of Software in Computing and Communication | Luo W.,Hefei University of Technology | Luo W.,Key Laboratory of Software in Computing and Communication | And 2 more authors.
Journal of University of Science and Technology of China | Year: 2011

A density estimation strategy is often adopted in order to guarantee better distribution and convergence in MOEA But the current density estimation strategies cannot achieve this goal when the number of objectives become large. Each objective was more generally considered and four novel strategies of density estimation were proposed. Then, they were applied in SPEA2, which was one of the classical MOEAs The experimental results of the test cases of MOKP with 4 to 9 objectives show that SPEA2 with the novel strategies have better convergence to the Pareto front on all test cases. Source


Wang F.,Hefei University of Technology | Wang F.,Key Laboratory of Software in Computing and Communication | Wang F.,A+ Network | Huang Z.,Hefei University of Technology | And 5 more authors.
Journal of Information and Computational Science | Year: 2013

Mesh editing plays an important role in the design of mesh models. The As-Rigid-As-Possible (ARAP) surface editing algorithm is likely to produce degenerated results in sharp regions. This degeneration affects the quality of results. This paper proposes a new mesh editing algorithm based on the ARAP surface modeling algorithm. By setting constraints on triangle transformations, this algorithm has better detail-preserving properties. With the constraints on the ratios among scaling factors, we can reduce the skinny triangles produced by the ARAP algorithm. The experimental results showed that this algorithm improved robustness and detail-preservation over the As-Rigid-As-Possible algorithm. Copyright © 2013 Binary Information Press. Source


Guo L.,University of Science and Technology of China | Guo L.,Key Laboratory of Software in Computing and Communication | Guo L.,A+ Network | Huang Z.,University of Science and Technology of China | And 5 more authors.
Journal of Computational Information Systems | Year: 2012

A parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this paper. The framework is composed of two parts: (1) construction of the stiffness matrix and right hand side vector; (2) a parallel sparse solver. We analyze the properties of NURBS basis, use the ELLPACK format to store the stiffness matrix. The parallel strategy is dividing the matrix and vectors into disjoint parts. Each core computes one part in parallel. We test the effectiveness and efficiency of the framework on an 8-core machine and a 48-core machine. The framework solves the 2-d poisson equation and can solve 1.05 million degrees of freedom in about 22 seconds using 32 cores. The speed-up of the construction reaches 28.3 using 32 cores. © 2012 Binary Information Press. Source

Discover hidden collaborations