CN105321208A - Method for accessing quadrilateral mesh subdivision surfaces based on vertex encoding - Google Patents
Method for accessing quadrilateral mesh subdivision surfaces based on vertex encoding Download PDFInfo
- Publication number
- CN105321208A CN105321208A CN201510894058.XA CN201510894058A CN105321208A CN 105321208 A CN105321208 A CN 105321208A CN 201510894058 A CN201510894058 A CN 201510894058A CN 105321208 A CN105321208 A CN 105321208A
- Authority
- CN
- China
- Prior art keywords
- vertex
- quadrilateral
- summit
- encoding
- subdivision
- 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.)
- Granted
Links
Landscapes
- Image Generation (AREA)
Abstract
The invention discloses a method for accessing quadrilateral mesh subdivision surfaces based on vertex encoding. The method disclosed by the invention comprises the following steps: (1) for an inputted to-be-subdivided quadrilateral mesh model, according to a given maximum subdivision level, encoding four vertexes of a to-be-subdivided quadrangle; (2) carrying out recursive subdivision on the to-be-subdivided quadrangle until the given maximum subdivision level reaches, and in every subdivision process, encoding newly-generated vertexes; (3) for all vertexes of subdivision surfaces, calculating the positions of vertex codes in a vertex array; and (4) according to the codes of four angular points of the uppermost subdivision surface, calculating the codes of an edge center and a surface center, and in a recursive fashion, obtaining vertex codes of all subdivision surfaces, and according to the codes, calculating the positions of the vertexes in the vertex array. According to the method, by using the vertex encoding method, the precise positioning of vertexes of quadrilateral mesh subdivision surfaces can be realized without storing the topological structure of the subdivision surfaces, thereby raising the utilization ratio and access efficiency of a memory.
Description
Technical field
The invention belongs to computer control and detection technique field, be specifically related to a kind of quadrilateral subdivision curved surface access method based on vertex encoding.
Background technology
The fields such as quadrilateral subdivision curved surface is widely used in solid modelling, video display are played up, game movie making.It is by segmenting quadrilateral, makes original grid more smooth-going.But quadrilateral subdivision curved surface stores, usually need to keep apex coordinate and topological structure, along with the increase of segmentation level, the unit number of subdivision curved surface increases by geometric progression, and EMS memory occupation amount sharply rises, and internal memory finally can be caused to overflow.
At present, usually adopt the method for self-adapting subdividing to reduce quadrilateral subdivision curved surface EMS memory occupation amount, namely utilize the mechanism of perspective projection, the quadrilateral units that can be presented in form is segmented, and the part that can not show does not process.Because this method does not affect visual effect, play up and game movie making so be widely used in video display, but this method is inapplicable solid modelling, because solid modelling needs to segment all unit usually.
For this reason, the present invention proposes a kind of quadrilateral subdivision curved surface access method based on vertex encoding, by a kind of coding method, different summit is uniquely corresponding with the memory location at its place, improve memory access efficiency, utilize the combination of coding simultaneously, any summit in subdivision curved surface and unit can be determined, avoid the memory cost brought owing to preserving subdivision curved surface topological structure, this method is widely used in solid modelling, video display are played up and game movie, can improve memory usage more than 55%.
Summary of the invention
For the above-mentioned technological deficiency existing for prior art, the invention provides a kind of quadrilateral subdivision curved surface access method based on vertex encoding, utilize a kind of vertex encoding method that summit is uniquely corresponding with its memory location, place, improve memory usage.
Based on a quadrilateral subdivision curved surface access method for vertex encoding, comprise the steps:
Step (1) treats segmentation quadrilateral to what input, according to given maximum segmentation level, for waiting four vertex encodings segmenting quadrilateral;
Step (2) is segmented quadrilateral to treating in step (1) and is carried out recursion, until reach given maximum segmentation level, and in each segmentation process, encodes to newly-generated summit;
Step (3) calculates the position of each vertex encoding in vertical array, then by the coordinate on each summit stored in position corresponding to this vertex encoding in vertical array.
Step (4) is according to the coding of most top layer subdivision curved surface four angle points, calculate the coding at center, limit and center, face, and then the vertex encoding of quadrilateral units in all subdivision curved surfaces is obtained by recursive fashion, calculate the position of this summit in vertical array according to vertex encoding, then extract apex coordinate according to the position calculated.
Treating segmentation network of quadrilaterals lattice model to what input in described step (1), according to given maximum segmentation level, for waiting four vertex encodings segmenting quadrilateral, comprising the steps:
1-1., according to given maximum segmentation level m, calculates and often goes and the number of vertices n often arranged after m segmentation,
1-2., according to clock-wise order, adopts decimal integer to treat four vertex encodings of segmentation quadrilateral, the front two of this decimal integer to should the row number of summit column, rear two to should the summit line number of being expert at, concrete:
1-2-1. chooses arbitrarily and waits to segment a summit in quadrilateral as initial vertex, and line number row number are 1,
1-2-2. chooses next summit along clockwise direction, and row number are 1, and line number is n;
1-2-3. chooses next summit along clockwise direction, and line number row number are n;
1-2-4. chooses next summit along clockwise direction, and row number are n, and line number is 1;
In described step (2), quadrilateral is segmented to treating in step (1) and carries out recursion, until reach given maximum segmentation level, and in each segmentation process, encoded in newly-generated summit, specifically comprise the steps:
2-1. is according to subdivision rules, and upgrade original apex coordinate, and generate new limit central point and face central point, limit central point is encoded to two vertex encoding averages on this limit, place, and face central point is encoded to vertex encoding average on the face diagonal of place;
2-2. repeats step 2-1, until reach maximum segmentation level.
Calculate the position of each vertex encoding in vertical array in described step (3), adopt following formula:
(number/MAX-1)×n+number％MAX-1；
Wherein number is vertex encoding, MAX choose just greater than n 10 integral number power;
Calculate the position of this summit in vertical array according to vertex encoding in described step (4), then extract apex coordinate according to the position calculated, the calculating of the position of its summit in vertical array adopts following formula:
(number/MAX-1)×n+number％MAX-1
Wherein number is vertex encoding, MAX choose just greater than n 10 integral multiple.
In described step (2), Catmull-Clark method is adopted to segment quadrilateral.
Beneficial effect of the present invention is as follows:
The present invention is uniquely corresponding with the memory location at its place by different summit by a kind of coding method, utilize the superposition of coding and coding simultaneously, any summit in subdivision curved surface and unit can be determined, avoid the memory cost brought owing to preserving subdivision curved surface topological structure, this method is widely used in solid modelling, video display are played up and game movie, can improve memory usage more than 55%.
Summary of the invention
Accompanying drawing explanation
Fig. 1 is the steps flow chart schematic diagram of quadrilateral subdivision curved surface access method of the present invention;
Fig. 2 (a) is the original quadrilateral coding to input;
Fig. 2 (b) is for segmenting result for the first time;
Fig. 2 (c) is for segmenting result for the second time;
Embodiment
In order to more specifically describe the present invention, below in conjunction with the drawings and the specific embodiments, quadrilateral subdivision curved surface access method of the present invention is described in detail.
As shown in Figure 1, a kind of based on vertex encoding quadrilateral subdivision curved surface access method, comprise the steps:
Step (1) to the original quadrilateral of input, according to given maximum segmentation level, for waiting to segment four vertex encodings of quadrilateral, as shown in Fig. 2 (a);
To the original network of quadrilaterals lattice model of input, according to given maximum segmentation level, be quadrilateral four vertex encodings to be segmented, comprise the steps:
1-1., according to given maximum segmentation level m, calculates and often goes and the number of vertices n often arranged after m segmentation,
1-2. according to clock-wise order, by a decimal integer to quadrilateral four vertex encodings, the front two of this integer to should the row number of summit column, rear two to should the summit line number of being expert at,
1-2-1. chooses arbitrarily a summit in quadrilateral as initial vertex, and line number row number are 1,
1-2-2. chooses next summit along clockwise direction, and row number are 1, and line number is n;
1-2-3. chooses next summit along clockwise direction, and line number row number are n;
1-2-4. chooses next summit along clockwise direction, and row number are n, and line number is 1;
Step (2) carries out recursion to the quadrilateral in step (1), until reach given maximum segmentation level, in each segmentation process, encodes, as shown in Fig. 2 (b) to newly-generated summit;
Recursion is carried out to the quadrilateral in step (1), until reach given maximum segmentation level, in each segmentation process, newly-generated node is encoded, comprises the steps:
2-1. is according to subdivision rules, and upgrade original apex coordinate, and generate new limit central point and face central point, limit central point is encoded to two vertex encoding averages of corresponding sides, and face central point is encoded to vertex encoding average on the face diagonal of place,
2-2. repeats step 2-1, until reach maximum segmentation level.
Catmull-Clark method is adopted to segment quadrilateral.
Step (3) is all summits of subdivision curved surface generated, and calculates the position of vertex encoding in vertical array, as shown in Fig. 2 (c);
Use formula (number/MAX-1) * n+number%MAX-1 to calculate the position of vertex encoding number in vertical array, wherein, MAX choose just greater than n 10 integral multiple;
Step (4), according to the coding of most top layer subdivision curved surface four angle points, is calculated the coding at center, limit and center, face, and then is obtained the coding on all subdivision curved surface summits by recursive fashion, calculates the position of this summit in vertical array according to coding.
Paracentral coding equals the coding mean value on corresponding sides summit, face centre code equals the mean value that corresponding surface diagonal line is encoded, and uses formula (number/MAX-1) * n+number%MAX-1 to calculate the position of vertex encoding number in vertical array.
Claims (6)
1., based on a quadrilateral subdivision curved surface access method for vertex encoding, it is characterized in that comprising the steps:
Step (1) treats segmentation quadrilateral to what input, according to given maximum segmentation level, for waiting four vertex encodings segmenting quadrilateral;
Step (2) is segmented quadrilateral to treating in step (1) and is carried out recursion, until reach given maximum segmentation level, and in each segmentation process, encodes to newly-generated summit;
Step (3) calculates the position of each vertex encoding in vertical array, then by the coordinate on each summit stored in position corresponding to this vertex encoding in vertical array.
Step (4) is according to the coding of most top layer subdivision curved surface four angle points, calculate the coding at center, limit and center, face, and then the vertex encoding of quadrilateral units in all subdivision curved surfaces is obtained by recursive fashion, calculate the position of this summit in vertical array according to vertex encoding, then extract apex coordinate according to the position calculated.
2. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 1, it is characterized in that: in described step (1), segmentation network of quadrilaterals lattice model is treated to what input, according to given maximum segmentation level, for waiting four vertex encodings segmenting quadrilateral, comprise the steps:
1-1., according to given maximum segmentation level m, calculates and often goes and the number of vertices n often arranged after m segmentation,
1-2., according to clock-wise order, adopts decimal integer to treat four vertex encodings of segmentation quadrilateral, the front two of this decimal integer to should the row number of summit column, rear two to should the summit line number of being expert at, concrete:
1-2-1. chooses arbitrarily and waits to segment a summit in quadrilateral as initial vertex, and line number row number are 1,
1-2-2. chooses next summit along clockwise direction, and row number are 1, and line number is n;
1-2-3. chooses next summit along clockwise direction, and line number row number are n;
1-2-4. chooses next summit along clockwise direction, and row number are n, and line number is 1.
3. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 2, it is characterized in that: in described step (2), quadrilateral is segmented to treating in step (1) and carries out recursion, until reach given maximum segmentation level, and in each segmentation process, encoded in newly-generated summit, specifically comprise the steps:
2-1. is according to subdivision rules, and upgrade original apex coordinate, and generate new limit central point and face central point, limit central point is encoded to two vertex encoding averages on this limit, place, and face central point is encoded to vertex encoding average on the face diagonal of place;
2-2. repeats step 2-1, until reach maximum segmentation level.
4. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 3, is characterized in that: calculate the position of each vertex encoding in vertical array in described step (3), adopt following formula:
(number/MAX-1)×n+number％MAX-1；
Wherein number is vertex encoding, MAX choose just greater than n 10 integral number power.
5. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 4, it is characterized in that: in described step (4), calculate the position of this summit in vertical array according to vertex encoding, then extract apex coordinate according to the position calculated, the calculating of the position of its summit in vertical array adopts following formula:
(number/MAX-1)×n+number％MAX-1
Wherein number is vertex encoding, MAX choose just greater than n 10 integral number power.
6. the quadrilateral subdivision curved surface access method based on vertex encoding according to claim 1,2,3,4 or 5, is characterized in that: in described step (2), adopts Catmull-Clark method to segment quadrilateral.
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 true CN105321208A (en) | 2016-02-10 |
| CN105321208B 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) |
Cited By (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 (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080043023A1 (en) * | 2006-08-15 | 2008-02-21 | Microsoft Corporation | Approximating subdivision surfaces with bezier patches |
| 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 |
-
2015
- 2015-12-07 CN CN201510894058.XA patent/CN105321208B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080043023A1 (en) * | 2006-08-15 | 2008-02-21 | Microsoft Corporation | Approximating subdivision surfaces with bezier patches |
| 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细分曲面的实现及求交技术研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105321208B (en) | 2017-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10783705B2 (en) | Tessellation method using recursive sub-division of triangles | |
| TWI517103B (en) | Method for data compression, computing system and computer program product | |
| US7209137B2 (en) | Efficient triangular shaped meshes | |
| CN113743137B (en) | Method and device for extracting one-dimensional signal | |
| CN105303620B (en) | A kind of triangular gridding subdivision curved surface access method based on vertex encoding | |
| US20140168360A1 (en) | Method and apparatus for encoding a 3d mesh | |
| WO2021062736A1 (en) | Division method, encoder, decoder, and computer storage medium | |
| CN107886569B (en) | Measurement-controllable surface parameterization method and system based on discrete lie derivative | |
| CN102509356A (en) | Detail-kept geometrical model deformation method using grid subdivision | |
| CN105321208A (en) | Method for accessing quadrilateral mesh subdivision surfaces based on vertex encoding | |
| CN1877640A (en) | Geometric data subdivision method based on triangle interpolation surface subdivision | |
| CN107038308A (en) | A kind of regular grid terrain modeling method based on linear interpolation | |
| CN108566208A (en) | A kind of coding method of level grid and device | |
| CN106656210A (en) | Method for constructing rapidly coded Type-II QC-LDPC code based on perfect cyclic difference sets | |
| CN104346798A (en) | Object delineation polygonal approximation method and device thereof | |
| CN109858096B (en) | Modeling method for optimized layout of single lightning rod system and terminal equipment | |
| CN107483948A (en) | Pixel macroblock processing method in a kind of webp compressions processing | |
| CN108614735A (en) | A kind of formwork calculation method and system based on space Mi Pu | |
| CN1975787A (en) | Geometric data subdivision method based on high-order triangle interpolation curved surface division | |
| CN107392935A (en) | A kind of particle computational methods and particIe system based on integral formula | |
| CN106815656B (en) | Method for acquiring cascade reservoir energy storage dispatching diagram | |
| CN105184849A (en) | Three-dimensional mesh model expression method based on surface patch chain codes | |
| CN114927202B (en) | Lung deformation simulation method and device and server | |
| CN103150711A (en) | Open computing language (OpenCL)-based image repair method | |
| CN104240232B (en) | A kind of road damage inspection optimization method based on image procossing |
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 | ||
| 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. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171226 Termination date: 20201207 |