CN105321208B - A kind of quadrilateral subdivision curved surface access method based on vertex encoding - Google Patents
A kind of quadrilateral subdivision curved surface access method based on vertex encoding Download PDFInfo
- Publication number
- CN105321208B CN105321208B CN201510894058.XA CN201510894058A CN105321208B CN 105321208 B CN105321208 B CN 105321208B CN 201510894058 A CN201510894058 A CN 201510894058A CN 105321208 B CN105321208 B CN 105321208B
- Authority
- CN
- China
- Prior art keywords
- subdivision
- summit
- vertex
- curved surface
- quadrangle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Image Generation (AREA)
Abstract
The invention discloses a kind of quadrilateral subdivision curved surface access method based on vertex encoding.The present invention comprises the following steps：(1) to the network of quadrilaterals lattice model to be segmented of input, according to given maximum subdivision level, for four vertex encodings of quadrangle to be segmented；(2) treat subdivision quadrangle and carry out recursion, until reaching given maximum subdivision level, in each segmentation process, newly-generated summit is encoded；(3) it is all summits of subdivision curved surface, calculates position of the vertex encoding in vertical array；(4) coding according to top four angle points of subdivision curved surface, the coding at side center and face center is calculated, and then the coding on all subdivision curved surface summits is obtained by recursive fashion, position of the summit in vertical array is calculated according to coding.The present invention utilizes vertex encoding method, is not required to store subdivision curved surface topological structure, just realizes and quadrangle subdivision curved surface summit is accurately positioned, improve memory usage and access efficiency.
Description
Technical field
The invention belongs to computer control and detection technique field, and in particular to a kind of quadrilateral subdivision based on vertex encoding
Curved surface access method.
Background technology
The fields such as quadrilateral subdivision curved surface is widely used in solid modelling, video display render, game movie makes.It
By being finely divided to quadrangle, original grid is set more to smooth out.But quadrilateral subdivision curved surface stores, it usually needs
Apex coordinate and topological structure are kept, with the increase of subdivision level, the unit number of subdivision curved surface increases by geometric progression, interior
Deposit occupancy to steeply rise, eventually result in internal memory spilling.
At present, the method for generally use self-adapting subdividing reduces quadrilateral subdivision curved surface EMS memory occupation amount, i.e., sharp
With the mechanism of perspective projection, it is finely divided for the quadrilateral units that can be shown in form, and the part that can not be shown is not
Process.Because this method does not influence on visual effect, made so being widely used in video display and rendering with game movie,
But this method does not apply to solid modelling but, because solid modelling usually requires to be finely divided all units.
Therefore, the present invention proposes a kind of quadrilateral subdivision curved surface access method based on vertex encoding, pass through one kind
Coding method is uniquely corresponding with the storage location where it by different summits, improves memory access efficiency, while utilize the group of coding
Close, it may be determined that any summit and unit in subdivision curved surface, avoid due to preserving subdivision curved surface topological structure and bring
Memory cost, this method is widely used in solid modelling, video display render and game movie, can improve memory usage 55% with
On.
The content of the invention
For the above-mentioned technological deficiency present in prior art, the invention provides a kind of quadrangle based on vertex encoding
Grid subdivision curved surface access method, it is using a kind of vertex encoding method that summit and storage location where it is uniquely corresponding, improve
Memory usage.
A kind of quadrilateral subdivision curved surface access method based on vertex encoding, comprises the following steps：
Step (1) segments level, for the four of quadrangle to be segmented to the quadrangle to be segmented of input according to given maximum
Individual vertex encoding；
Step (2) carries out recursion to the quadrangle to be segmented in step (1), until reaching given maximum subdivision of reservoir
It is secondary, and newly-generated summit is encoded in segmentation process every time；
Step (3) calculates position of each vertex encoding in vertical array, and the coordinate on each summit then is stored in into top
Position corresponding to the vertex encoding in point array.
Coding of the step (4) according to top four angle points of subdivision curved surface, calculates the coding at side center and face center, enters
And the vertex encoding of quadrilateral units in all subdivision curved surfaces is obtained by recursive fashion, calculate the summit according to vertex encoding
Position in vertical array, then according to the position extraction apex coordinate calculated.
To the network of quadrilaterals lattice model to be segmented of input in described step (1), according to given maximum subdivision level, it is
Four vertex encodings of quadrangle to be segmented, comprise the following steps：
The maximum subdivision level m that 1-1. foundations give, calculates the number of vertices n often to be gone after m subdivision with each column,
1-2. treats four vertex encodings of subdivision quadrangle using decimal integer according to clock-wise order, and this ten enters
The front two of integer processed to should summit column row number, latter two to should the line number be expert at of summit, specifically：
It is 1 that 1-2-1., which arbitrarily chooses a summit in quadrangle to be segmented as initial vertex, line number row number,
1-2-2. chooses next summit, row number 1, line number n along clockwise direction；
1-2-3. chooses next summit along clockwise direction, and line number row number is n；
1-2-4. chooses next summit, row number n, line number 1 along clockwise direction；
In described step (2), recursion is carried out to the quadrangle to be segmented in step (1), until reaching given
Maximum subdivision level, and newly-generated summit is encoded, specifically comprised the following steps in segmentation process every time：
2-1. updates original apex coordinate, and generate new side central point and face central point, side center according to subdivision rules
Point is encoded to two vertex encoding averages on the place side, and vertex encoding is averaged on face diagonal where face central point is encoded to
Number；
2-2. repeat step 2-1, until reaching maximum subdivision level.
Position of each vertex encoding in vertical array is calculated in described step (3), using equation below：
(number/MAX-1) × n+number%MAX-1；
Wherein number is vertex encoding, and MAX chooses 10 integral number power just greater than n；
Position of the summit in vertical array is calculated according to vertex encoding in described step (4), then according to meter
The position extraction apex coordinate calculated, the calculating of position of its summit in vertical array use equation below：
(number/MAX-1) × n+number%MAX-1
Wherein number is vertex encoding, and MAX chooses 10 integral multiple just greater than n.
In described step (2), quadrangle is finely divided using Catmull-Clark methods.
The present invention has the beneficial effect that：
The present invention is uniquely corresponding with the storage location where it by different summits by a kind of coding method, while utilizes volume
The superposition of code and coding, it may be determined that any summit and unit in subdivision curved surface, avoid due to preserving subdivision curved surface topology
Structure and the memory cost brought, this method is widely used in solid modelling, video display render and game movie, can improve internal memory
Utilization rate more than 55%.
The content of the invention
Brief description of the drawings
Fig. 1 is the step schematic flow sheet of quadrilateral subdivision curved surface access method of the present invention；
Fig. 2 (a) is that the original quadrangle of input is encoded；
Fig. 2 (b) is subdivision result for the first time；
Fig. 2 (c) is second of subdivision result；
Embodiment
In order to more specifically describe the present invention, below in conjunction with the accompanying drawings and embodiment is to network of quadrilaterals of the invention
Lattice subdivision curved surface access method is described in detail.
As shown in figure 1, a kind of be based on vertex encoding quadrilateral subdivision curved surface access method, comprise the following steps：
Step (1) segments level, for four of quadrangle to be segmented to the original quadrangle of input according to given maximum
Vertex encoding, as shown in Fig. 2 (a)；
To the original network of quadrilaterals lattice model of input, according to given maximum subdivision level, for quadrangle four to be segmented
Individual vertex encoding, comprises the following steps：
The maximum subdivision level m that 1-1. foundations give, calculates the number of vertices n often to be gone after m subdivision with each column,
1-2. is according to clock-wise order, with a decimal integer to four vertex encodings of quadrangle, preceding the two of the integer
Position to should summit column row number, latter two to should the line number be expert at of summit,
It is 1 that 1-2-1., which arbitrarily chooses a summit in quadrangle as initial vertex, line number row number,
1-2-2. chooses next summit, row number 1, line number n along clockwise direction；
1-2-3. chooses next summit along clockwise direction, and line number row number is n；
1-2-4. chooses next summit, row number n, line number 1 along clockwise direction；
Step (2) carries out recursion to the quadrangle in step (1), until reaching given maximum subdivision level, often
In secondary segmentation process, newly-generated summit is encoded, as shown in Fig. 2 (b)；
Recursion is carried out to the quadrangle in step (1), until reach given maximum subdivision level, it is subdivided every time
Cheng Zhong, newly-generated node is encoded, comprised the following steps：
2-1. updates original apex coordinate, and generate new side central point and face central point, side center according to subdivision rules
Point is encoded to two vertex encoding averages of corresponding sides, and vertex encoding is averaged on face diagonal where face central point is encoded to
Number,
2-2. repeat step 2-1, until reaching maximum subdivision level.
Quadrangle is finely divided using Catmull-Clark methods.
Step (3) is all summits of subdivision curved surface of generation, calculates position of the vertex encoding in vertical array, such as Fig. 2
(c) shown in；
Vertex encoding number is calculated in vertical array using formula (number/MAX-1) * n+number%MAX-1
Position, wherein, MAX choose just greater than n 10 integral multiple；
Coding of the step (4) according to top four angle points of subdivision curved surface, calculates the coding at side center and face center, enters
And the coding on all subdivision curved surface summits is obtained by recursive fashion, calculate position of the summit in vertical array according to coding
Put.
Equal to the coding average value on corresponding sides summit, face centre code is equal on corresponding face diagonal to be compiled paracentral coding
The average value of code, vertex encoding number is calculated in vertical array using formula (number/MAX-1) * n+number%MAX-1
In position.
Claims (5)
1. a kind of quadrilateral subdivision curved surface access method based on vertex encoding, it is characterised in that comprise the following steps：
Step (1) is to the quadrangle to be segmented of input, and according to given maximum subdivision level, four for quadrangle to be segmented are pushed up
Point coding；
Step (2) carries out recursion to the quadrangle to be segmented in step (1), until reach given maximum subdivision level,
And newly-generated summit is encoded in segmentation process every time；
Step (3) calculates position of each vertex encoding in vertical array, and the coordinate on each summit then is stored in into number of vertex
Position corresponding to the vertex encoding in group；
Coding of the step (4) according to top four angle points of subdivision curved surface, calculate the coding at side center and face center, Jin Ertong
Cross recursive fashion and obtain the vertex encoding of quadrilateral units in all subdivision curved surfaces, calculating the summit according to vertex encoding is pushing up
Position in point array, then according to the position extraction apex coordinate calculated；
In described step (1), to the network of quadrilaterals lattice model to be segmented of input, according to given maximum subdivision level, to treat
Four vertex encodings of quadrangle are segmented, are comprised the following steps：
The maximum subdivision level m that 1-1. foundations give, calculates the number of vertices n often to be gone after m subdivision with each column,
1-2. treats four vertex encodings for segmenting quadrangle using decimal integer, the decimal system is whole according to clock-wise order
Several front twos to should summit column row number, latter two to should the line number be expert at of summit, specifically：
It is 1 that 1-2-1., which arbitrarily chooses a summit in quadrangle to be segmented as initial vertex, line number row number,
1-2-2. chooses next summit, row number 1, line number n along clockwise direction；
1-2-3. chooses next summit along clockwise direction, and line number row number is n；
1-2-4. chooses next summit, row number n, line number 1 along clockwise direction.
2. the quadrilateral subdivision curved surface access method according to claim 1 based on vertex encoding, it is characterised in that：
In described step (2), recursion is carried out to the quadrangle to be segmented in step (1), until reaching given maximum subdivision
Level, and newly-generated summit is encoded, specifically comprised the following steps in segmentation process every time：
2-1. foundation subdivision rules, update original apex coordinate, and generate new side central point and face central point, and side central point is compiled
Code is two vertex encoding averages on the place side, vertex encoding average on face diagonal where face central point is encoded to；
2-2. repeat step 2-1, until reaching maximum subdivision level.
3. the quadrilateral subdivision curved surface access method according to claim 2 based on vertex encoding, it is characterised in that：
Position of each vertex encoding in vertical array is calculated in described step (3), using equation below：
(number/MAX-1) × n+number%MAX-1；
Wherein number is vertex encoding, and MAX chooses 10 integral number power just greater than n.
4. the quadrilateral subdivision curved surface access method according to claim 3 based on vertex encoding, it is characterised in that：
Position of the summit in vertical array is calculated according to vertex encoding in described step (4), then according to the position calculated
Extraction apex coordinate is put, the calculating of position of its summit in vertical array uses equation below：
(number/MAX-1) × n+number%MAX-1
Wherein number is vertex encoding, and MAX chooses 10 integral number power just greater than n.
5. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 1,2,3 or 4, it is special
Sign is：In described step (2), quadrangle is finely divided using Catmull-Clark methods.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510894058.XA CN105321208B (en) | 2015-12-07 | 2015-12-07 | A kind of quadrilateral subdivision curved surface access method based on vertex encoding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510894058.XA CN105321208B (en) | 2015-12-07 | 2015-12-07 | A kind of quadrilateral subdivision curved surface access method based on vertex encoding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105321208A CN105321208A (en) | 2016-02-10 |
| CN105321208B true CN105321208B (en) | 2017-12-26 |
Family
ID=55248519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510894058.XA Expired - Fee Related CN105321208B (en) | 2015-12-07 | 2015-12-07 | A kind of quadrilateral subdivision curved surface access method based on vertex encoding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105321208B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109407617A (en) * | 2018-09-20 | 2019-03-01 | 上海电机学院 | A kind of NC knife rail generating method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102509356A (en) * | 2011-11-10 | 2012-06-20 | 杭州电子科技大学 | Detail-kept geometrical model deformation method using grid subdivision |
| CN103559374A (en) * | 2013-11-25 | 2014-02-05 | 中国科学院自动化研究所 | Method for subdividing surface split type curved surfaces on multi-submesh model |
| CN103810756A (en) * | 2014-01-17 | 2014-05-21 | 浙江大学 | Adaptive Loop subdivision surface drawing method based on irregular region |
| CN104318594A (en) * | 2014-10-16 | 2015-01-28 | 南京师范大学 | Quadrilateral meshing method for plane vector field |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080043023A1 (en) * | 2006-08-15 | 2008-02-21 | Microsoft Corporation | Approximating subdivision surfaces with bezier patches |
-
2015
- 2015-12-07 CN CN201510894058.XA patent/CN105321208B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102509356A (en) * | 2011-11-10 | 2012-06-20 | 杭州电子科技大学 | Detail-kept geometrical model deformation method using grid subdivision |
| CN103559374A (en) * | 2013-11-25 | 2014-02-05 | 中国科学院自动化研究所 | Method for subdividing surface split type curved surfaces on multi-submesh model |
| CN103810756A (en) * | 2014-01-17 | 2014-05-21 | 浙江大学 | Adaptive Loop subdivision surface drawing method based on irregular region |
| CN104318594A (en) * | 2014-10-16 | 2015-01-28 | 南京师范大学 | Quadrilateral meshing method for plane vector field |
Non-Patent Citations (1)
| Title |
|---|
| Catmull_Clark细分曲面的实现及求交技术研究;李娜;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20090515;第11，39-42，47-51页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105321208A (en) | 2016-02-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105303620B (en) | A kind of triangular gridding subdivision curved surface access method based on vertex encoding | |
| CN102565810B (en) | Method for extracting land utilization landmark boundary outline on remote sensing image | |
| CN103413143B (en) | Video target tracking method based on dynamic sparse projection | |
| US9959670B2 (en) | Method for rendering terrain | |
| CN102324107B (en) | Pervasive-terminal-oriented continuous and multi-resolution encoding method of three-dimensional grid model | |
| CN103530689A (en) | Deep learning-based clustering method | |
| CN105654552B (en) | A kind of quick Delaunay network construction methods towards Arbitrary distribution large-scale point cloud data | |
| CN106530397B (en) | A kind of geology face three-dimensional rebuilding method based on sparse section geology contour line | |
| CN106981097A (en) | A kind of T spline surface approximating methods based on subregion Local Fairing weight factor | |
| CN105321208B (en) | A kind of quadrilateral subdivision curved surface access method based on vertex encoding | |
| CN106960470A (en) | Three-dimensional point cloud curve reestablishing method and device | |
| CN103136775A (en) | KINECT depth map cavity filling method based on local restriction reconstruction | |
| CN1877640A (en) | Geometric data subdivision method based on triangle interpolation surface subdivision | |
| CN105389596A (en) | Method for enabling convolutional neural network to be suitable for recognition of pictures of various sizes | |
| CN107038308A (en) | A kind of regular grid terrain modeling method based on linear interpolation | |
| CN105160442A (en) | Physical layout algorithm for circular pieces | |
| CN104346798A (en) | Object delineation polygonal approximation method and device thereof | |
| CN105184849B (en) | Three-dimensional grid model representation method based on dough sheet chain code | |
| CN106815656B (en) | Method for acquiring cascade reservoir energy storage dispatching diagram | |
| CN109767492A (en) | Space calculation method for three-dimensional model of transformer substation | |
| CN116721228B (en) | Building elevation extraction method and system based on low-density point cloud | |
| CN107392935A (en) | A kind of particle computational methods and particIe system based on integral formula | |
| CN117274517A (en) | Method for generating light-weight body frame model of urban building based on three-dimensional model | |
| CN104240232B (en) | A kind of road damage inspection optimization method based on image procossing | |
| CN110838161B (en) | Method for aggregating large-batch graph nodes of OSG in three-dimensional scene |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191213 Address after: 510530 room 1923, building 3, Ruifeng center, Kaichuang Avenue, Huangpu District, Guangzhou City, Guangdong Province Patentee after: Guangzhou bud rice Intellectual Property Service Co., Ltd. Address before: Hangzhou City, Zhejiang province 310018 Xiasha Higher Education Park No. 2 street Patentee before: Hangzhou Electronic Science and Technology Univ |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200131 Address after: 518116 International Automobile Exhibition Center 3f301, No. 98, Longfei Avenue, Yuanshan street, Longgang District, Shenzhen City, Guangdong Province Patentee after: Shenzhen Xiu age culture media Co., Ltd. Address before: 510530 room 1923, building 3, Ruifeng center, Kaichuang Avenue, Huangpu District, Guangzhou City, Guangdong Province Patentee before: Guangzhou bud rice Intellectual Property Service Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171226 Termination date: 20201207 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |