20:
295:
139:
Doo–Sabin surfaces are defined recursively. Like all subdivision procedures, each refinement iteration, following the procedure given, replaces the current mesh with a "smoother", more refined mesh. After many iterations, the surface will gradually converge onto a smooth limit surface.
163:
220:
23:
A Doo-Sabin mesh after 2 levels of refinement. The new faces come from vertices, edges and faces of the original mesh (colored dark, white, and midtone respectively).
113:
82:
155:. The solution is, however, not as computationally efficient as for Catmull–Clark surfaces because the Doo–Sabin subdivision matrices are not (in general)
262:
336:
144:
117:
new faces at each original face. A primary characteristic of the Doo–Sabin subdivision method is the creation of four faces and four edges (
216:
360:
188:
123:
4) around every new vertex in the refined mesh. A drawback is that the faces created at the original vertices may be triangles or
365:
355:
329:
182:
193:
59:
uniform B-splines. The subdivision refinement algorithm was developed in 1978 by Daniel Doo and
Malcolm Sabin.
280:
322:
270:
179:(equivalent geometric operation) - facets are moved apart after being separated, and new facets are formed
259:
156:
119:
55:
176:
28:
36:
243:
19:
258:, Proceedings of SIGGRAPH'98. In Computer Graphics Proceedings, ACM SIGGRAPH, 1998, 395–404 (
302:
91:
266:
224:
306:
215:, Proceedings on Interactive Techniques in Computer Aided Design, pp. 157 - 165, 1978 (
67:
349:
50:
256:
Exact
Evaluation of Catmull–Clark Subdivision Surfaces at Arbitrary Parameter Values
162:
41:
294:
213:
A subdivision algorithm for smoothing down irregularly shaped polyhedrons
152:
128:
46:
185:- a set of related topological polyhedron and polygonal mesh operators
62:
The Doo-Sabin process generates one new face at each original vertex,
124:
166:
Two Doo–Sabin refinement iterations on a ⊥-shaped quadrilateral mesh
240:
Behaviour of recursive division surfaces near extraordinary points
161:
151:
without any recursive refinement, by means of the technique of
310:
94:
70:
107:
76:
330:
8:
242:, Computer Aided Design, pp. 356-360, 1978 (
337:
323:
234:
232:
99:
93:
69:
16:Type of polygon mesh in computer graphics
86:new faces along each original edge, and
18:
204:
147:, Doo–Sabin limit surfaces can also be
7:
291:
289:
14:
189:Catmull-Clark subdivision surface
293:
1:
39:based on a generalization of
33:Doo–Sabin subdivision surface
309:. You can help Knowledge by
271:downloadable eigenstructures
382:
361:Multivariate interpolation
288:
183:Conway polyhedron notation
127:that are not necessarily
53:was based on generalized
194:Loop subdivision surface
366:Computer science stubs
167:
145:Catmull–Clark surfaces
109:
78:
24:
165:
110:
108:{\displaystyle n^{2}}
79:
22:
356:3D computer graphics
92:
68:
29:3D computer graphics
37:subdivision surface
281:Doo–Sabin surfaces
265:2018-05-09 at the
223:2011-07-07 at the
168:
149:evaluated directly
105:
74:
25:
318:
317:
77:{\displaystyle n}
373:
339:
332:
325:
303:computer science
297:
290:
274:
252:
246:
238:D.Doo, M.Sabin:
236:
227:
209:
116:
114:
112:
111:
106:
104:
103:
85:
83:
81:
80:
75:
381:
380:
376:
375:
374:
372:
371:
370:
346:
345:
344:
343:
286:
277:
267:Wayback Machine
253:
249:
237:
230:
225:Wayback Machine
210:
206:
202:
173:
137:
95:
90:
89:
87:
66:
65:
63:
17:
12:
11:
5:
379:
377:
369:
368:
363:
358:
348:
347:
342:
341:
334:
327:
319:
316:
315:
298:
284:
283:
276:
275:
247:
228:
203:
201:
200:External links
198:
197:
196:
191:
186:
180:
172:
169:
157:diagonalizable
136:
133:
102:
98:
73:
15:
13:
10:
9:
6:
4:
3:
2:
378:
367:
364:
362:
359:
357:
354:
353:
351:
340:
335:
333:
328:
326:
321:
320:
314:
312:
308:
305:article is a
304:
299:
296:
292:
287:
282:
279:
278:
272:
268:
264:
261:
257:
251:
248:
244:
241:
235:
233:
229:
226:
222:
218:
214:
208:
205:
199:
195:
192:
190:
187:
184:
181:
178:
175:
174:
170:
164:
160:
158:
154:
150:
146:
141:
134:
132:
130:
126:
122:
121:
100:
96:
71:
60:
58:
57:
52:
51:Catmull-Clark
48:
44:
43:
38:
35:is a type of
34:
30:
21:
311:expanding it
300:
285:
255:
250:
239:
212:
207:
148:
143:Just as for
142:
138:
118:
61:
54:
42:bi-quadratic
40:
32:
26:
350:Categories
254:Jos Stam,
135:Evaluation
49:, whereas
177:Expansion
47:B-splines
263:Archived
221:Archived
211:D. Doo:
171:See also
153:Jos Stam
129:coplanar
56:bi-cubic
45:uniform
120:valence
115:
88:
84:
64:
125:n-gons
301:This
307:stub
31:, a
260:pdf
217:pdf
27:In
352::
269:,
231:^
219:)
159:.
131:.
338:e
331:t
324:v
313:.
273:)
245:)
101:2
97:n
72:n
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
