Results 211 to 220 of about 112,147 (237)

Interpolating Subdivisions from Approximating Subdivisions

Journal of Information and Computational Science, 2013
A subdivision surface is a method of representing a smooth, continuous, seamless surface via the specification of a coarser piecewise linear polygon mesh. In this paper, we propose an innovative unified method for constructing interpolating subdivisions.
openaire   +1 more source

Subdivision vertex & subdivision vertex neighborhood

Advances in Mathematics: Scientific Journal, 2020
Let us newly define the Subdivision vertex corona and subdivision vertex neighbourhood corona product of the Cycle graph $ C_m $, for any $ m\ge3 $ with empty graph $ \overline{K_n} $, for any $ n \ge1 $. Additionally we will give generalization result based on the graph $ S({C_m}\odot\overline{K_n})$ and $ S_N({C_m}\boxdot\overline{K_n})$ for any ...
D. Kalamani, G. Kiruthika
openaire   +1 more source

4–8 Subdivision

Computer Aided Geometric Design, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Velho, Luiz, Zorin, Denis
openaire   +1 more source

On interpolatory subdivision from approximating subdivision scheme

Applied Mathematics and Computation, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luo, Zhongxuan, Qi, Wanfeng
openaire   +1 more source

Loop subdivision surface reconstruction with subdivision connectivity

Proceedings 2011 International Conference on Transportation, Mechanical, and Electrical Engineering (TMEE), 2011
A Loop subdivision surface reconstruction method to reproduce a triangular mesh with subdivision connectivity is proposed, which can make full use of the multiresolution analysis of subdivision surface. Firstly, the base mesh is created by removing maximally the independent set of vertices. After resampling the base mesh, progressive interpolation (PI)
null Chen Tiantian, null Zhao Gang
openaire   +1 more source

Subdivision Termination Criteria in Subdivision Multivariate Solvers

2006
The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1, 2, 3] typically employ the convex hull and subdivision/domain clipping properties of the Bezier/B-spline representation to detect all regions that may contain a feasible solution.
Iddo Hanniel, Gershon Elber
openaire   +1 more source

Deforming subdivisions

Mathematical Programming, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Subdivisions

2022
openaire   +2 more sources

Subdivision

2012
Jakob Andreas Bærentzen, Jens Gravesen, François Anton, Henrik Aanæs   +3 more
openaire   +2 more sources

Subdivision

2002
Joe Warren, Henrik Weimer
openaire   +1 more source