Surface2Volume: Surface Segmentation Conforming Assemblable Volumetric Partition

April 23, 2019 Β· Declared Dead Β· πŸ› ACM Transactions on Graphics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Chrystiano AraΓΊjo, Daniela Cabiddu, Marco Attene, Marco Livesu, Nicholas Vining, Alla Sheffer arXiv ID 1904.10213 Category cs.GR: Graphics Citations 21 Venue ACM Transactions on Graphics Last Checked 5 months ago
Abstract
Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The alternative is to partition them into single-attribute volumetric parts that can be fabricated separately and then assembled to form the target object. Facilitating this approach requires partitioning the input model into parts that conform to the surface segmentation and that can be moved apart with no collisions. We propose Surface2Volume, a partition algorithm capable of producing such assemblable parts, each of which is affiliated with a single attribute, the outer surface of whose assembly conforms to the input surface geometry and segmentation. In computing the partition we strictly enforce conformity with surface segmentation and assemblability, and optimize for ease of fabrication by minimizing part count, promoting part simplicity, and simplifying assembly sequencing. We note that computing the desired partition requires solving for three types of variables: per-part assembly trajectories, partition topology, i.e. the connectivity of the interface surfaces separating the different parts, and the geometry, or location, of these interfaces. We efficiently produce the desired partitions by addressing one type of variables at a time: first computing the assembly trajectories, then determining interface topology, and finally computing interface locations that allow parts assemblability. We algorithmically identify inputs that necessitate sequential assembly, and partition these inputs gradually by computing and disassembling a subset of assemblable parts at a time. We demonstrate our method....
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Graphics

R.I.P. πŸ‘» Ghosted

Everybody Dance Now

Caroline Chan, Shiry Ginosar, ... (+2 more)

cs.GR πŸ› ICCV πŸ“š 820 cites 7 years ago
R.I.P. πŸ‘» Ghosted

Animating Human Athletics

Jessica K. Hodgins, Wayne L. Wooten, ... (+2 more)

cs.GR πŸ› SIGGRAPH πŸ“š 765 cites 3 years ago

Died the same way β€” πŸ‘» Ghosted