lawonder

2021-course

berkeley-cs-188

Berkeley CS 188 Artificial Intelligence [Projects Work]

Fast-Quadric-Mesh-Simplification

Mesh triangle reduction using quadrics

MeshSimplification

MeshSimplify

Mesh Simplification based on edge-collapse algorithm

tthresh

C++ compressor for multidimensional grid data using the Tucker decomposition

Vertex-Clustering

This is a computer graphics project. Mesh simplification: vetex-clustering research. Meaning: drawing triangles for simulating object will cost a lot of time each time we draw it if there are too many points and too many triangles to draw withing a certain area. So do the mesh simplification will reduce the vertices and the triangles to be draw, so the time that using for drawing the picture will be greatly reduced. There are several technologies for reducing the points like vertex clustering, edge collapse, vertex removal, vertex decimation. I use vertex clustering.

volumeRender

webgl-volumerendering

WebGL based implementation of 3D volume rendering

lawonder/berkeley-cs-188

Berkeley CS 188 Artificial Intelligence [Projects Work]

lawonder/Fast-Quadric-Mesh-Simplification

Mesh triangle reduction using quadrics

lawonder/MeshSimplification

lawonder/MeshSimplify

Mesh Simplification based on edge-collapse algorithm

lawonder/tthresh

C++ compressor for multidimensional grid data using the Tucker decomposition

lawonder/Vertex-Clustering

This is a computer graphics project. Mesh simplification: vetex-clustering research. Meaning: drawing triangles for simulating object will cost a lot of time each time we draw it if there are too many points and too many triangles to draw withing a certain area. So do the mesh simplification will reduce the vertices and the triangles to be draw, so the time that using for drawing the picture will be greatly reduced. There are several technologies for reducing the points like vertex clustering, edge collapse, vertex removal, vertex decimation. I use vertex clustering.

lawonder/2021-course

lawonder/volumeRender