MASC Research Areas

Recent Highlights

Computational kirigami wrapping
We presented a work on computational kirigami wrapping, a universal method to wrap 3D-curved surfaces beyond materiality. (to appear in Science Advances 2020)
Visibility Integrity
We proposed an efficient method to compute Visibility Integrity that measures if points from a region can see similar objects. Visibility Integrity is then used to plan motion of the camera following a moving flock in 3D. (IEEE RA-L / IROS, 2019 Fall)

Compacting Voxelized Polyhedra via Tree Stacking
We developed a heuristic based pipeline that finds the optimal tree-structured stacking that provides both significant volume compaction and better stability. (Computer Graphics Forum / Pacific Graphics, 2019 Fall)

Computational Laser Origami of Convex Surfaces
We develop the first known computational method to fabricate convex 3D metal surfaces using laser forming. (ACM SCF, 2019 Spring)

Super Compaction and Transformation
image We found a universal method to compact 3D shapes via stacking while allowing transformation between different shapes. (2018 Spring)

Creating Easily Foldable Polyhedral Nets
image We proposed a learning strategy that creates easily foldable or even linearly foldable polyhedral nets. Planing a continuous folding motion for these optimized nets requires orders of magnitude less computation. (RSS and ACM SCF, 2018 Spring)

3D Paper Model Patterns
We maintain a repository to archive the unfoldings (nets) of polyhedra created by our software tools. Models will continue to be added.

Material Transfer
Guilin Liu and researchers at Adobe created a Physically Based Rendering Network that can synthesize realistic re-rendering of a single object with different surface materials. (ICCV, 2017 Fall)

Layer Decomposition
We proposed a way to decompose a single image into layers of monochrome image via RGB-space geometry. (TOG, 2017 Summer)

Disjoint Convex Shell
We developed a software tool that turns a shape into a set of disjoint convex objects and made paper crafting much easier. See the project page: DC shell for detail. (SPM, 2017 Spring)

Making Shadow Art
Making Shadow Art
Our work on shadow art is featured on the cover page of magazine Hyperseeing. (2016 Summer)

Local Minkowski Sum
We construct local Minkowski sum to enable continuous penetration depth on complex shapes. (2016 Spring)

Learning to Segment and Unfold
image We proposed to simultaneously segment and unfold a non-convex mesh into foldable patterns by learning from failed unfoldings. This makes paper crafting easier. (2016 Spring)

Continuous Visibility Feature
A new type of visibility measurement named Continuous Visibility Feature (CVF) is proposed. CVF better encodes the surface and part information of mesh than the tradition line-of-sight based visibility. CVF can be used for many shape analysis tasks. (2015 Spring)

Convex Ridge Separation
We investigate an approach that decomposes a mesh based on the identification of Convex Ridges. Intuitively, convex ridges are the protruding parts of the mesh. (2014 Fall)

Dual-Space Decomposition
image We proposed a new decomposition method, called Dual-space Decomposition that handles complex 2D shapes by recognizing the importance of the negative areas (e.g. holes). This work is to be published in CVPR 2014. (2014 Spring)

Folding rigid origami
We developed an adaptive randomized search to fold rigid origami. Ph.D. student Zhonghua Xi created several web-based tools for creating crease patterns and planning folding motions. (2014 Spring)

Predict Collisions
We found a way to compute the earliest collision time for a mobile robot (modeled as a point or polygon) moving among obstacles (polygon or articulated object) whose motion is unknown. (2013 Winter)

More in archived research hightlighs

All Projects

Research projects at MASC group are supported in part by NSF, DOT (FHWA), USGS, AFOSR, CIT and George Mason University

List of MASC Research Pages
Computer Science @ George Mason University