Jcg.subdivision

Class LoopSubdivision

java.lang.Object

Jcg.subdivision.SubdivisionMethod_3

Jcg.subdivision.LoopSubdivision

public class LoopSubdivision
extends SubdivisionMethod_3

Perform the Loop subdivision scheme Only for triangular meshes (without boundary)

Author:

Luca Castelli Aleardi (Ecole Polytechnique, 2012)

Field Summary

Fields inherited from class Jcg.subdivision.SubdivisionMethod_3

polyhedron3D

Constructor Summary

Constructors

Constructor and Description
LoopSubdivision(Polyhedron_3<Point_3> polyhedron)

Method Summary

Modifier and Type	Method and Description
Point_3	computeEdgePoint(Halfedge<Point_3> h) Compute a new edge point (given the half-edge h)
java.util.HashMap<Halfedge<Point_3>,Point_3>	computeEdgePoints() Compute all new edge points and store the result in an HashMap
Point_3	computeNewVertexLocation(Vertex<Point_3> v) Compute the new coordinates for a vertex (already existing in the initial mesh)
Point_3[]	computeNewVertexLocations() Compute the new coordinates for all vertices of the initial mesh
void	splitEdges(java.util.HashMap<Halfedge<Point_3>,Point_3> edgePoints) Splits all edges by inserting a new vertex
void	subdivide() The main method performing the subdivision process To be implemented
void	subdivideFace(Face<Point_3> f) Perform the subdivision of a face into 4 triangular sub-faces Edges must already be split: the face has degree 3+3

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LoopSubdivision

public LoopSubdivision(Polyhedron_3<Point_3> polyhedron)

Method Detail

subdivide

public void subdivide()

The main method performing the subdivision process To be implemented

Specified by:

subdivide in class SubdivisionMethod_3

splitEdges

public void splitEdges(java.util.HashMap<Halfedge<Point_3>,Point_3> edgePoints)

Splits all edges by inserting a new vertex

subdivideFace

public void subdivideFace(Face<Point_3> f)

Perform the subdivision of a face into 4 triangular sub-faces Edges must already be split: the face has degree 3+3

computeEdgePoint

public Point_3 computeEdgePoint(Halfedge<Point_3> h)

Compute a new edge point (given the half-edge h)

computeEdgePoints

public java.util.HashMap<Halfedge<Point_3>,Point_3> computeEdgePoints()

Compute all new edge points and store the result in an HashMap

computeNewVertexLocation

public Point_3 computeNewVertexLocation(Vertex<Point_3> v)

Compute the new coordinates for a vertex (already existing in the initial mesh)

computeNewVertexLocations

public Point_3[] computeNewVertexLocations()

Compute the new coordinates for all vertices of the initial mesh