CN103810756B - The method for drafting of self adaptive Loop subdivision curved surface based on irregular area - Google Patents
The method for drafting of self adaptive Loop subdivision curved surface based on irregular area Download PDFInfo
- Publication number
- CN103810756B CN103810756B CN201410021013.7A CN201410021013A CN103810756B CN 103810756 B CN103810756 B CN 103810756B CN 201410021013 A CN201410021013 A CN 201410021013A CN 103810756 B CN103810756 B CN 103810756B
- Authority
- CN
- China
- Prior art keywords
- dough sheet
- plies
- original
- subdivision
- segmentation
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000001788 irregular Effects 0.000 title claims abstract description 41
- 230000003044 adaptive effect Effects 0.000 title abstract description 6
- 230000011218 segmentation Effects 0.000 claims abstract description 74
- 230000001154 acute effect Effects 0.000 claims description 6
- 230000006870 function Effects 0.000 claims description 4
- 239000003973 paint Substances 0.000 abstract 1
- 238000009877 rendering Methods 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000000465 moulding Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000007670 refining Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Landscapes
- Image Generation (AREA)
Abstract
The method for drafting of the Loop subdivision curved surface providing a kind of adaptivity based on irregular area of the present invention, this method for drafting adaptive mode based on irregular area, utilize the position calculating shader computations control vertex, relation according to current original dough sheet with the segmentation number of plies of adjacent original dough sheet, by the sub-dough sheet that irregular original patch division is several rules, trigonometric framework lattice are reconstructed, drawn by tessellation tinter again and obtain corresponding dough sheet, can effectively eliminate T crack.Tessellation tinter can be used to paint accurately by segmentation and be calculated the position on each layer summit in trigonometric framework lattice, the most all calculated summits are all identical with limit L oop subdivision curved surface with normal vector, and the drafting of hardware tessellation tinter, solve huge internal memory and the bandwidth problem of Global Subdivision method, it is possible to reach real-time accurate Drawing Loop subdivision curved surface.
Description
Technical field
The present invention relates to computer graphics subdivision curved surface field of drawing, be specifically related to a kind of based on
The method for drafting of the Loop subdivision curved surface of the adaptivity of irregular area.
Background technology
Subdivision curved surface, in field of Computer Graphics, the grid for arbitrary topology creates smooth
Curved surface.Subdivision curved surface is defined as the calculating of an infinite thinning process.Initial by repeatedly refining
Polygonal mesh, the subdivision curved surface that a series of grid tends to final can be produced.Each new
What refinement step generation one was new has more polygon element and more smooth network.Loop
Subdivision curved surface is as wherein comparing a representative segmentation Strategy, at electronic game, electricity
It is widely used in the application such as shadow making and finite element simulation, sees C.Loop, Smooth
subdivision surfaces based on triangles,Master’s thesis,Dept.of Math.,
Univ.of Utah(1987).Loop subdivision curved surface is the triangle Controling network for arbitrary topology
Lattice design, it is different from Catmull-Clark subdivision curved surface, sees E.Catmull, J.Clark,
Recursively generated b-spline surfaces on arbitrary topological meshes,
Computer-Aided Design10(6)(1978)350–355。
Traditional subdivision curved surface is according to subdivision rules, and cyclically micro-stepping control grid computing draws
's.Although this method is easily achieved on the GPU in the present age.But, exponential increase
Internal memory occupancy volume and volume of transmitted data can be serious affect operational efficiency.Along with DirectX11
The appearance of API, hardware tessellation tinter therein, can be in GPU stream multiprocessing, directly
Connect calculating, generate, draw the geometry of segmentation, reach to avoid the internal memory input and output of high cost,
Draw the purpose of the high-quality surface-rendering of fine geometric detail, see Microsoft
Corporation,Direct3D11Features,
http://msdn.microsoft.com/en-us/library/ff476342(VS.85).aspx(2009).But
It is that hardware tessellation draws curved surface and calculates by dough sheet.Although it can be used in directly
Computation rule dough sheet, but for such as singular vertex, accurate sharp-pointed folding line and with different levels editor are so
Irregular area, it is impossible to directly calculate.
Current existing Loop subdivision method for drafting is divided into three major types.First, Global Subdivision
Method.Such method is realized by the segmentation that input controls grid circulation of the overall situation.This type of side
The memory consumption of method is with the summit quantity linear increase generated.Owing to the bandwidth of GPU limits,
Cause the degradation of performance, see L.Shiue, I.Jones, J.Peters, A realtimegpu
subdivision kernel,ACM Transactions on Graphics24(3)(2005)
1010–1015.Second, direct calculation method.Such method is the segmentation square to subdivision curved surface
The eigenmatrix analytical analysis of battle array, directly calculates and solves subdivision curved surface, see J.Stam,
Evaluation of Loop subdivision surfaces,in:ACM SIGGRAPH99
Course Notes#37,SIGGRAPH’99,ACM,New York,NY,USA,1999,
pp.111–125.Although this type of method easily realizes on GPU, but due to substantial amounts of program
Code branch, causes runnability poor.Additionally, such method needs singular point to separate, because of
This, need to do the initial grid that controls once to the pre-segmentation of twice, the control after so processing
The summit of grid processed and dough sheet quantity are all by substantial increase;And, such method cannot process and make
Accurate sharp-pointed folding line that type is common and editing by different level.Finally, approximate algorithm based on dough sheet.
It is to find a solution approaching irregular area that such algorithm is considered carefully substantially, improves and draws efficiency,
Sacrifice rendering quality.Such method utilizes hardware tessellation tinter to draw subdivision curved surface,
See document G.Li, C.Ren, J.Zhang, W.Ma, Approximation of Loop
subdivision surfaces for fast rendering,IEEE Transactions on
Visualization and Computer Graphics17(4)(2011)。
Summary of the invention
For the deficiencies in the prior art, the invention provides a kind of based on irregular area adaptive
GPU is answered to draw Loop subdivision surface methodology.
A kind of method for drafting of the Loop subdivision curved surface of adaptivity based on irregular area,
Including:
(1) input trigonometric framework lattice, and set the maximum segmentation number of plies and Global Subdivision parameter;
(2) determine the irregular area of trigonometric framework lattice, and using this irregular area as
The level 0 topological structure of trigonometric framework lattice, generates triangle according to level 0 topological structure and controls
The level 0 segmentation look-up table of grid, builds trigonometric framework lattice according to level 0 segmentation look-up table
Ground floor topological structure, and according to ground floor topological structure generate trigonometric framework lattice first
Layer segmentation look-up table;
(3) recursion successively, obtains the n-th layer segmentation of trigonometric framework lattice search until building
Table and n-th layer topological structure, wherein n is equal to the maximum segmentation number of plies set;
(4) position of each layer segmentation look-up table and level 0 control vertex is uploaded to GPU,
The tinter that calculates of GPU segments look-up table and the position of last layer control vertex according to each layer,
It is calculated the position of each layer control vertex successively;
(5) control of each original dough sheet in this topological structure is constructed according to each etale topology structure
Dough sheet controls dough sheet as this layer, and determines that each controls the parameter field of dough sheet, specific as follows:
(5-1) will be each according to the segmentation number of plies residing for each original dough sheet in described topological structure
Individual original dough sheet is divided into ordinary dough sheet and non-trivial dough sheet:
If the segmentation number of plies of the adjacent original dough sheet in the limit of current original dough sheet is respectively less than or is equal to work as
The segmentation number of plies of front original dough sheet, the most current original dough sheet is ordinary dough sheet,
Otherwise, current original dough sheet is non-trivial dough sheet;
If (5-2) current original dough sheet is ordinary dough sheet, then with a ring of current original dough sheet
The vertex index of neighborhood is as the control dough sheet of current original dough sheet, and determines this control dough sheet
Parameter field;
If current original dough sheet is non-trivial dough sheet, then proceed as follows:
(5-21) ought more than the segmentation number of plies of current original dough sheet according to the adjacent original dough sheet in limit
Front original dough sheet is divided into some sub-dough sheets,
(5-22) using the vertex index of a ring neighborhood of current original dough sheet as each sub-dough sheet
Control dough sheet, and determine each control dough sheet parameter field;
(6) currently segment the number of plies according to Global Subdivision parameter determination, control according to each layer respectively
The position on summit, each layer control dough sheet and each parameter field of dough sheet that controls by tessellation
Tinter drafting level 0 dough sheet is to g_depth aspect sheet, and g_depth is for currently segmenting the number of plies.
In step (1), the trigonometric framework lattice of input include the control vertex of level 0.
Described step (2), step (3) and step (5) can be that off-line is carried out.
Topological structure structure comprises each original dough sheet, each dough sheet is connected with each other, Bian Xiang
Proximal surface sheet refers to that the dough sheet sharing limit (having common edge) with this dough sheet becomes the adjacent dough sheet in limit.
The method for drafting intermediate cam of the Loop subdivision curved surface of the present invention controls grid, maximum segmentation
The number of plies and Global Subdivision parameter are set by the user, wherein trigonometric framework lattice and the maximum segmentation number of plies
The drawing process of Loop subdivision curved surface typically no longer adjusts, and Global Subdivision parameter exists
In the drawing process of Loop subdivision curved surface, user can need to adjust in real time according to display.
Segmentation look-up table and the input that the method for drafting of the Loop subdivision curved surface of the present invention uses
The geometry of trigonometric framework lattice is unrelated, and at the such triangle gridding of similar curved editor or animation
Keep in topologically invariant application, the generation of this segmentation look-up table and upload and only need once, to change
Need not regenerate and upload segmentation look-up table after becoming Global Subdivision parameter.
The drafting side of the Loop subdivision curved surface of the adaptivity based on irregular area of the present invention
Method, adaptive mode based on irregular area, utilize and calculate tinter parallel computation control top
The position of point, utilizes tessellation tinter to draw dough sheet.By utilizing, GPU's is parallel
Disposal ability, solves huge internal memory and the bandwidth problem of Global Subdivision method.It addition,
Tessellation tinter can only the dough sheet of direct accurate Drawing regular domain, but due to may phase
Proximal surface sheet is on different subdivision of reservoir, directly draws dough sheet meeting according to tessellation tinter
T-shaped crack there is, subdivision of reservoir according to current original dough sheet with adjacent original dough sheet in the present invention
The relation of number, is some sub-dough sheets by irregular original patch division, then according to sub-face
Sheet reconstruct trigonometric framework lattice, directly structure there will be T-shaped crack, it is impossible to (former with generatrix sheet
Beginning dough sheet) it is that unit is drawn, it is necessary to draw in units of sub-dough sheet, then by tessellation
Color device is drawn and is obtained corresponding dough sheet, can effectively eliminate T crack.
In described step (1), the maximum segmentation number of plies and Global Subdivision parameter meet following condition:
1.0≤g_tessfactor≤2n,
Wherein, g_tessfactor is Global Subdivision parameter, and n is the maximum segmentation number of plies.
The maximum segmentation number of plies is equivalent to a constraint, and user sets as required, in actual application
N is less than 8.
Described irregular area is the singular point of trigonometric framework lattice, half acute vertex and layering
Secondary in-edit.Generally trigonometric framework lattice with singular point, half acute vertex and are edited by different level
Point, these points are irregular area, and constitute the level 0 topology knot of these trigonometric framework lattice
Structure.
Singular point degree of referring to is not the summit of 6.
Half acute vertex refers to that each limit can be referred to by user on the trigonometric framework lattice of input
A fixed sharp-pointed value, represents the acuity after the segmentation of this limit.If one the sharp-pointed value on limit is not
Zero, then this limit is half sharp edge.If the limit of a summit connection is not zero containing sharp-pointed value
Limit, then this point is half sharp point, the subacute meaning be this sharp-pointed value can be non-integer.
In-edit refers to according to moulding needs by different level, to trigonometric framework on difference segmentation level
Lattice do the point edited, and the Limit Surface of Loop subdivision curved surface is to be made up of four box splines, removes
Around singular point, it is be made up of an infinite number of four box spline curye surfaces.
Described segmentation table includes edge point table and point table,
Described edge point table is for recording in irregular area adjacent the two of each limit, edge point place
The index on four summits of individual triangle;
Described some point table is for recording the index on each summit in irregular area, and each pushes up
The degree of point, and a ring neighborhood vertex index on each summit and the original position on a ring neighborhood summit.
During each step of Loop subdivision curved surface is segmented, need controlling each of grid
Bar limit and summit are segmented.Segmenting the summit obtained on limit is edge point, and opposite vertexes segmentation obtains
Summit be referred to as some a point.
With a summit with an interconnective point in limit, become a ring neighborhood summit on this summit.
In edge point table and some point table, each content of record is stored respectively in corresponding caching, top
The index of point is corresponding to indexed cache, in degree degree of the being stored in caching on summit, a ring neighborhood summit
Original position use side-play amount represent, this side-play amount be stored in side-play amount caching in.
Described control vertex includes edge point and summit.
During the position of the control vertex calculating each layer in described step (4) in calculating tinter
Being respectively provided with edge point thread and some point thread, described edge point thread is used for calculating the position of edge point,
Described some point thread is for calculating the position on summit.
When calculating some point, from indexed cache, obtain this vertex index by a some thread, from degree caching
Read the degree on this summit, obtain this summit one ring neighborhood vertex index by side-play amount caching and initiate
Position, is starting point from this position, reads several (equal with this Vertex Degree) vertex index,
And then obtain the index on a ring neighborhood summit on this summit, so, obtain all vertex index,
Employing list of references: C.Loop, Smooth subdivision surfaces based on triangles,
Master ' s thesis, Dept.of Math., Univ.of Utah (1987). in the method reported for work, meter
Point coordinates is put in calculation accordingly.In like manner, the coordinate of available corresponding edge point.
Described step (5-21) including:
If a the adjacent original dough sheet in () only one of which limit is more than the segmentation number of plies of current original dough sheet,
With the adjacent original dough sheet in this limit and the midpoint of the common edge of current original dough sheet with this is the most original
In dough sheet, the line on the summit that this common edge is relative is cut-off rule, is split as by current original dough sheet
Two sub-dough sheets;
If b () has two adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line at two adjacent original dough sheets in limit and the midpoint of the common edge of current original dough sheet and times
The meaning midpoint of one common edge and the line relative with this common edge be cut-off rule will be the most original
Dough sheet is split as three sub-dough sheets;
If c () has three adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line two-by-two at the midpoint on three limits of current original dough sheet as cut-off rule, will the most original
Sheet is split as four sub-dough sheets.
Described step (6) comprises the following steps:
(6-1) according to formula:
Determining and currently segment the number of plies, wherein g_depth is for currently to segment the number of plies, and g_tessfactor is
Global Subdivision parameter,Represent log2G_tessfactor rounds up;
(6-2) according to formula:
tessfactori+1=tessfactori/ 2,
Calculate the subdivision parameter of i+1 layer, wherein tessfactoriIt is the subdivision parameter of i-th layer,
I=0,1 ..., g_depth, wherein tessfactor0=g_tessfactor;
(6-3) based on four box spline basic functions, according to subdivision parameter, the control of each layer
Summit, control dough sheet and each parameter field controlling dough sheet draw the dough sheet of equivalent layer.
The subdivision parameter of later layer is determined by the subdivision parameter of preceding layer, later layer in the present invention
Subdivision parameter be the twice of subdivision parameter of preceding layer.After obtaining the subdivision parameter of each layer,
Use four box spline basic functions can draw the dough sheet obtaining equivalent layer.After often segmenting once
Control grid to can be understood as being subdivided once, then subdivision parameter halves.
Compared with the method for drafting of existing Loop subdivision curved surface, the Loop of the present invention is thin
The method for drafting of point curved surface adaptive mode by irregular area, according to irregular dough sheet
Type, by some the sub-dough sheets that are divided into of irregular dough sheet, then with the sub-dough sheet life obtained
The control dough sheet becoming these trigonometric framework lattice carries out dough sheet drafting.Can be used by segmentation
Tessellation tinter is painted and is accurately calculated the position on each layer summit in trigonometric framework lattice,
The most all calculated summits are all identical with limit L oop subdivision curved surface with normal vector, and
Hardware tessellation tinter is drawn, and the huge internal memory and the bandwidth that solve Global Subdivision method are asked
Topic, it is possible to reach real-time accurate Drawing Loop subdivision curved surface.
Accompanying drawing explanation
Fig. 1 is the flow chart of the method for drafting of the Loop subdivision curved surface of the present invention;
Fig. 2 is method for splitting and the determination schematic diagram of parameter field of raw frames.
Detailed description of the invention
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
A kind of self adaptation GPU based on irregular area draws Loop subdivision surface methodology, bag
Include following steps:
(1) input trigonometric framework lattice, and set the maximum segmentation number of plies and Global Subdivision parameter,
And the maximum segmentation number of plies and Global Subdivision parameter meet following condition:
1.0≤g_tessfactor≤2n,
Wherein, g_tessfactor is Global Subdivision parameter, and n is the maximum segmentation number of plies (this enforcement
G_tessfactor=1.0 in example, n=8).
(2) determine the irregular area of trigonometric framework lattice, and using this irregular area as
The level 0 topological structure of trigonometric framework lattice, generates triangle according to level 0 topological structure and controls
The level 0 segmentation look-up table of grid, builds trigonometric framework lattice according to level 0 segmentation look-up table
Ground floor topological structure, and according to ground floor topological structure generate trigonometric framework lattice first
Layer segmentation look-up table.
Irregular area is the singular point of trigonometric framework lattice, half acute vertex and edits by different level
Point.In the present embodiment: singular point degree of referring to is not the summit of 6, half acute vertex refers to connection
Bian Zhongyou is sharply worth the summit on the limit being not zero;In-edit refers to according to moulding needs by different level,
On different segmentation levels, trigonometric framework lattice are done the point edited.
(3) recursion successively, obtains the n-th layer segmentation of trigonometric framework lattice search until building
Table and n-th layer topological structure, wherein n is equal to the maximum segmentation number of plies set;
Segmentation look-up table includes edge point table and some point table, and edge point table is used for recording in irregular area
The index on four summits of adjacent two trianglees on each limit, edge point place;Point point table is used for remembering
The index on each summit in record irregular area, the degree on each summit, and the one of each summit
Ring neighborhood vertex index and the original position on a ring neighborhood summit.
(4) position of each layer segmentation look-up table and level 0 control vertex is uploaded to GPU,
The tinter that calculates of GPU segments look-up table and the position of last layer control vertex according to each layer,
It is calculated the position of each layer control vertex successively.
(5) control of each original dough sheet in this topological structure is constructed according to each etale topology structure
Dough sheet controls dough sheet as this layer, and determines that each controls the parameter field of dough sheet, specific as follows:
(5-1) will be each according to the segmentation number of plies residing for each original dough sheet in described topological structure
Individual original dough sheet is divided into ordinary dough sheet and non-trivial dough sheet:
If the segmentation number of plies of the adjacent original dough sheet in the limit of current original dough sheet is respectively less than or is equal to work as
The segmentation number of plies of front original dough sheet, the most current original dough sheet is ordinary dough sheet,
Otherwise, current original dough sheet is non-trivial dough sheet;
If (5-2) current original dough sheet is ordinary dough sheet, then with a ring of current original dough sheet
The vertex index of neighborhood is as the control dough sheet of current original dough sheet, and determines this control dough sheet
Parameter field;
If current original dough sheet is non-trivial dough sheet, then proceed as follows:
(5-21) ought more than the segmentation number of plies of current original dough sheet according to the adjacent original dough sheet in limit
Front original dough sheet is divided into some sub-dough sheets, specific as follows:
If a the adjacent original dough sheet in () only one of which limit is more than the segmentation number of plies of current original dough sheet,
With the adjacent original dough sheet in this limit and the midpoint of the common edge of current original dough sheet with this is the most original
In dough sheet, the line on the summit that this common edge is relative is cut-off rule, is split as by current original dough sheet
Two sub-dough sheets;
If b () has two adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line at two adjacent original dough sheets in limit and the midpoint of the common edge of current original dough sheet and times
The meaning midpoint of one common edge and the line relative with this common edge be cut-off rule will be the most original
Dough sheet is split as three sub-dough sheets;
If c () has three adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line two-by-two at the midpoint on three limits of current original dough sheet as cut-off rule, will the most original
Sheet is split as four sub-dough sheets.
(5-22) using the vertex index of a ring neighborhood of current original dough sheet as each sub-dough sheet
Control dough sheet, and determine each control dough sheet parameter field.
The basis of the parameter field controlling dough sheet of each sub-dough sheet of ordinary dough sheet in the present embodiment
The computational methods of barycentric coodinates determine.
In the present embodiment non-trivial dough sheet control dough sheet segmentation rule, and segmentation after each
The determination method of the parameter field of sub-dough sheet as in figure 2 it is shown, in figure dotted line represent cut-off rule, 1.,
2., 3. and 4. it is the numbering of sub-dough sheet.
As shown in Figure 2 (a) shows, if the adjacent original dough sheet in only one of which limit is more than the most original
The segmentation number of plies of sheet, then be split as the sub-dough sheet of two shown in Fig. 2 (a) by current original dough sheet.
1. the parameter field of work song dough sheet is:
2. the parameter field of work song dough sheet is:
As shown in Fig. 2 (b), if having two adjacent original dough sheets in limit more than current original dough sheet
The segmentation number of plies, then current original dough sheet is split as three sub-dough sheets, wherein:
1. the parameter field of work song dough sheet is:
2. the parameter field of work song dough sheet is:
3. the parameter field of work song dough sheet is:
As shown in Figure 2 (c), if having three adjacent original dough sheets in limit more than current original dough sheet
The segmentation number of plies, then current original dough sheet is split as four sub-dough sheets.Wherein:
1. the parameter field of work song dough sheet is:
2. the parameter field of work song dough sheet is:
3. the parameter field of work song dough sheet is:
4. the parameter field of work song dough sheet is:
(6) currently segment the number of plies according to Global Subdivision parameter determination, control according to each layer respectively
The position on summit, each layer control dough sheet and each parameter field of dough sheet that controls by tessellation
Tinter drafting level 0 dough sheet is to g_depth aspect sheet, and g_depth is for currently segmenting the number of plies.
Specifically include procedure below:
(6-1) according to formula:
Determining and currently segment the number of plies, wherein g_depth is for currently to segment the number of plies, and g_tessfactor is
Global Subdivision parameter,Represent log2G_tessfactor rounds up;
(6-2) according to formula:
tessfactori+1=tessfactori/ 2,
Calculate the subdivision parameter of i+1 layer, wherein tessfactoriIt is the subdivision parameter of i-th layer,
I=0,1 ..., g_depth, wherein tessfactor0=g_tessfactor;
(6-3) based on four box spline basic functions, according to subdivision parameter, the control of each layer
Summit, control dough sheet and each parameter field controlling dough sheet draw the dough sheet of equivalent layer.
The above, the only detailed description of the invention of the present invention, but protection scope of the present invention is also
Being not limited to this, any those familiar with the art is at the technology model that the invention discloses
In enclosing, the change that can readily occur in or replacement, all should contain within protection scope of the present invention.
Claims (8)
1. a method for drafting for the Loop subdivision curved surface of adaptivity based on irregular area,
It is characterized in that, comprise the steps:
(1) input trigonometric framework lattice, and set the maximum segmentation number of plies and Global Subdivision parameter;
(2) determine the irregular area of trigonometric framework lattice, and using this irregular area as
The level 0 topological structure of trigonometric framework lattice, generates triangle according to level 0 topological structure and controls
The level 0 segmentation look-up table of grid, builds trigonometric framework lattice according to level 0 segmentation look-up table
Ground floor topological structure, and according to ground floor topological structure generate trigonometric framework lattice first
Layer segmentation look-up table;
(3) recursion successively, obtains the n-th layer segmentation of trigonometric framework lattice search until building
Table and n-th layer topological structure, wherein n is equal to the maximum segmentation number of plies set;
(4) position of each layer segmentation look-up table and level 0 control vertex is uploaded to GPU,
The tinter that calculates of GPU segments look-up table and the position of last layer control vertex according to each layer,
It is calculated the position of each layer control vertex successively;
(5) control of each original dough sheet in this topological structure is constructed according to each etale topology structure
Dough sheet controls dough sheet as this layer, and determines that each controls the parameter field of dough sheet, specific as follows:
(5-1) will be each according to the segmentation number of plies residing for each original dough sheet in described topological structure
Individual original dough sheet is divided into ordinary dough sheet and non-trivial dough sheet:
If the segmentation number of plies of the adjacent original dough sheet in the limit of current original dough sheet is respectively less than or is equal to work as
The segmentation number of plies of front original dough sheet, the most current original dough sheet is ordinary dough sheet,
Otherwise, current original dough sheet is non-trivial dough sheet;
If (5-2) current original dough sheet is ordinary dough sheet, then with a ring of current original dough sheet
The vertex index of neighborhood is as the control dough sheet of current original dough sheet, and determines this control dough sheet
Parameter field;
If current original dough sheet is non-trivial dough sheet, then proceed as follows:
(5-21) ought more than the segmentation number of plies of current original dough sheet according to the adjacent original dough sheet in limit
Front original dough sheet is divided into some sub-dough sheets,
(5-22) using the vertex index of a ring neighborhood of current original dough sheet as each sub-dough sheet
Control dough sheet, and determine each control dough sheet parameter field;
(6) currently segment the number of plies according to Global Subdivision parameter determination, control according to each layer respectively
The position on summit, each layer control dough sheet and each parameter field of dough sheet that controls by tessellation
Tinter drafting level 0 dough sheet is to g_depth aspect sheet, and g_depth is for currently segmenting the number of plies.
2. the Loop subdivision of adaptivity based on irregular area as claimed in claim 1
The method for drafting of curved surface, it is characterised in that in described step (1), the maximum segmentation number of plies is with complete
Office's subdivision parameter meets following condition:
1.0≤g_tessfactor≤2n,
Wherein, g_tessfactor is Global Subdivision parameter, and n is the maximum segmentation number of plies.
3. the Loop subdivision of adaptivity based on irregular area as claimed in claim 2
The method for drafting of curved surface, it is characterised in that described irregular area is trigonometric framework lattice
Singular point, half acute vertex and in-edit by different level.
4. the Loop subdivision of adaptivity based on irregular area as claimed in claim 3
The method for drafting of curved surface, it is characterised in that described segmentation look-up table includes edge point table and puts point
Table,
Described edge point table is for recording in irregular area adjacent the two of each limit, edge point place
The index on four summits of individual triangle;
Described some point table is for recording the index on each summit in irregular area, and each pushes up
The degree of point, and a ring neighborhood vertex index on each summit and the original position on a ring neighborhood summit.
5. the Loop subdivision of adaptivity based on irregular area as claimed in claim 4
The method for drafting of curved surface, it is characterised in that described control vertex includes edge point and summit.
6. the Loop subdivision of adaptivity based on irregular area as claimed in claim 5
The method for drafting of curved surface, it is characterised in that calculate the position of control vertex in described step (4)
In calculating tinter, edge point thread and some point thread, described edge point thread it is respectively provided with when putting
For calculating the position of edge point, described some point thread is for calculating the position on summit.
7. the Loop subdivision of adaptivity based on irregular area as claimed in claim 6
The method for drafting of curved surface, it is characterised in that described step (5-21) including:
If a the adjacent original dough sheet in () only one of which limit is more than the segmentation number of plies of current original dough sheet,
With the adjacent original dough sheet in this limit and the midpoint of the common edge of current original dough sheet with this is the most original
In dough sheet, the line on the summit that this common edge is relative is cut-off rule, is split as by current original dough sheet
Two sub-dough sheets;
If b () has two adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line at two adjacent original dough sheets in limit and the midpoint of the common edge of current original dough sheet and times
The meaning midpoint of one common edge and the line relative with this common edge be cut-off rule will be the most original
Dough sheet is split as three sub-dough sheets;
If c () has three adjacent original dough sheets in limit segmentation number of plies more than current original dough sheet,
With the line two-by-two at the midpoint on three limits of current original dough sheet as cut-off rule, will the most original
Sheet is split as four sub-dough sheets.
8. the Loop subdivision of adaptivity based on irregular area as claimed in claim 7
The method for drafting of curved surface, it is characterised in that described step (6) comprises the following steps:
(6-1) according to formula:
Determining and currently segment the number of plies, wherein g_depth is for currently to segment the number of plies, and g_tessfactor is
Global Subdivision parameter,Represent log2G_tessfactor rounds up;
(6-2) according to formula:
tessfactori+1=tessfactri/ 2,
Calculate the subdivision parameter of i+1 layer, wherein tessfactoriIt is the subdivision parameter of i-th layer,
I=0,1 ..., g_depth, wherein tessfactor0=g_tessfactor;
(6-3) based on four box spline basic functions, according to subdivision parameter, the control of each layer
Summit, control dough sheet and each parameter field controlling dough sheet draw the dough sheet of equivalent layer.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410021013.7A CN103810756B (en) | 2014-01-17 | 2014-01-17 | The method for drafting of self adaptive Loop subdivision curved surface based on irregular area |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410021013.7A CN103810756B (en) | 2014-01-17 | 2014-01-17 | The method for drafting of self adaptive Loop subdivision curved surface based on irregular area |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103810756A CN103810756A (en) | 2014-05-21 |
CN103810756B true CN103810756B (en) | 2016-08-17 |
Family
ID=50707470
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410021013.7A Expired - Fee Related CN103810756B (en) | 2014-01-17 | 2014-01-17 | The method for drafting of self adaptive Loop subdivision curved surface based on irregular area |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103810756B (en) |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104183008B (en) * | 2014-07-31 | 2017-01-18 | 浙江大学 | Shader classification method and device based on surface signal fitting and tessellation and graphics rendering method |
CN104616327B (en) * | 2014-07-31 | 2017-07-14 | 浙江大学 | A kind of tinter method for simplifying, device and method for rendering graph based on surface subdivision |
GB2533443B (en) * | 2015-06-05 | 2018-06-06 | Imagination Tech Ltd | Tessellation method using recursive sub-division of triangles |
GB2533444B (en) * | 2015-06-05 | 2017-08-16 | Imagination Tech Ltd | Tessellation method |
CN104966313B (en) * | 2015-06-12 | 2017-09-19 | 浙江大学 | The geometrical shadow drawing method that triangle is rebuild |
CN105321208B (en) * | 2015-12-07 | 2017-12-26 | 杭州电子科技大学 | A kind of quadrilateral subdivision curved surface access method based on vertex encoding |
CN106887042B (en) * | 2017-01-23 | 2020-05-19 | 北京工业大学 | GPU-based adaptive surface subdivision method |
CN109407617A (en) * | 2018-09-20 | 2019-03-01 | 上海电机学院 | A kind of NC knife rail generating method |
CN116051786B (en) * | 2023-03-29 | 2023-06-02 | 核工业航测遥感中心 | Quick display method for standard grid three-dimensional model |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101639946A (en) * | 2009-08-26 | 2010-02-03 | 北京农业信息技术研究中心 | Plant leaf three-dimensional model geometric description and curved surface reconstruction method and system |
CN101853527A (en) * | 2009-04-01 | 2010-10-06 | 北京工业大学 | Interpolation subdividing method |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090225078A1 (en) * | 2008-03-07 | 2009-09-10 | Jaroslaw Roman Rossignac | Rendering Curves Through Iterative Refinement |
-
2014
- 2014-01-17 CN CN201410021013.7A patent/CN103810756B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101853527A (en) * | 2009-04-01 | 2010-10-06 | 北京工业大学 | Interpolation subdividing method |
CN101639946A (en) * | 2009-08-26 | 2010-02-03 | 北京农业信息技术研究中心 | Plant leaf three-dimensional model geometric description and curved surface reconstruction method and system |
Non-Patent Citations (4)
Title |
---|
Approximation of loop subdivision surfaces for fast rendering;Li G Q,Ren C J,Zhang J H,et al;《IEEE Transactions on Visualization and Computer Graphics》;20110217;第500-513页 * |
Feature-adaptive GPU rt.n(kjriiig of Catmull Clark subdivision surfaces;NieBner M.Loop C.Meyer M,et al;《ACM Transactions on Graphics(TOG) 》;20120131;第31卷(第1期);第1-11页 * |
基于GPU的自由曲面快速绘制;黄通浪;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160515(第5期);第19-20页,第39-46页 * |
基于GPU的试点相关自适应细分;李胜等;《计算机辅助设计与图形学学报》;20170430;第19卷(第4期);第409-414页 * |
Also Published As
Publication number | Publication date |
---|---|
CN103810756A (en) | 2014-05-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103810756B (en) | The method for drafting of self adaptive Loop subdivision curved surface based on irregular area | |
CN105183405A (en) | 3D printing method for user-defined surface hollow model | |
US10922852B2 (en) | Oil painting stroke simulation using neural network | |
CN101853525B (en) | Mesh segmentation based simplification method for preserving details of textured model | |
CN102521870B (en) | Coloring reuse method for micro-polygon ray tracing | |
CN106652008A (en) | Method automatically forming grid and shader multi-layer detail | |
CN103177451A (en) | Three-dimensional matching algorithm between adaptive window and weight based on picture edge | |
CN104183020B (en) | Atural object mesh simplification method based on the local secondary error measure with penalty term | |
US20210343080A1 (en) | Subdividing a three-dimensional mesh utilizing a neural network | |
CN106898040A (en) | Virtual resource object rendering intent and device | |
CN105976306A (en) | Energy consumption-error budget-based real-time drawing method | |
KR20230167746A (en) | Method and system for generating polygon meshes approximating surfaces using root-finding and iteration for mesh vertex positions | |
Rahim et al. | Evaluation of adaptive subdivision method on mobile device | |
CN106887042A (en) | Self adaptation surface subdivision method based on GPU | |
CN114092625A (en) | Real-time multi-scale high-frequency material rendering method and system based on normal map | |
Guo et al. | Multichannel 3D ink painting rendering model based on the LMS algorithm | |
CN103390080A (en) | Plant disease speckle color simulation method and device | |
US11954802B2 (en) | Method and system for generating polygon meshes approximating surfaces using iteration for mesh vertex positions | |
CN106708499A (en) | Analysis method and analysis system of drawing processing program | |
CN111063036B (en) | Three-dimensional character arrangement method, medium, equipment and system based on path planning | |
US20230394767A1 (en) | Method and system for generating polygon meshes approximating surfaces using root-finding and iteration for mesh vertex positions | |
CN107633543A (en) | Consider the stripe shape corresponding method of local topology | |
CN106846489A (en) | A kind of method that obj files are processed based on vtk | |
Runions et al. | Ribbons: A representation for point clouds | |
Liu et al. | Target shape controlled cloud animation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160817 Termination date: 20210117 |
|
CF01 | Termination of patent right due to non-payment of annual fee |