---
title: Loop subdivision surface
slug: loop-subdivision-surface
qid: Q729249
snapshot: loop-subdivision-surface-083562-ba49fc647d538e2b
content_hash: ba49fc647d538e2b301f0707d2bd912c86feb25f6b2e939b8d1b3ff721ceba82
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1363333435
tags: [10363121, 20356687, 23468805, 23603337, 26220375, 26709305]
---

# Loop subdivision surface

> [!note] Provenance
> Snapshot `loop-subdivision-surface-083562-ba49fc647d538e2b` · content root `ba49fc647d538e2b…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1363333435> · Licensed CC BY-SA 4.0

; refinement steps zero, one, and two In computer graphics, the Loop method for subdivision surfaces is an approximating subdivision scheme developed by Charles Loop in 1987 for triangular meshes. Prior methods, namely Catmull-Clark and Doo-Sabin, focused on quad meshes. Loop subdivision surfaces are defined recursively, dividing each triangle into four smaller ones. The method is based on a quartic box spline. It generates C 2 continuous limit surfaces everywhere except at extraordinary vertices, where they are C 1 continuous.

; refinement steps zero, one, and two In computer graphics, the Loop method for subdivision surfaces is an approximating subdivision scheme developed by Charles Loop in 1987 for triangular meshes. Prior methods, namely Catmull-Clark and Doo-Sabin, focused on quad meshes. Loop subdivision surfaces are defined recursively, dividing each triangle into four smaller ones. The method is based on a quartic box spline. It generates C 2 continuous limit surfaces everywhere except at extraordinary vertices, where they are C 1 continuous. == See also== Geodesic polyhedron Catmull-Clark subdivision surface Doo-Sabin subdivision surface
