9 citations · 13 across the 3 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
cs.CG2002
Optimally cutting a surface into a disk
Jeff Erickson, Sariel Har-Peled
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number…
cs.CG2002★ 9 cited
Building Space-Time Meshes over Arbitrary Spatial Domains
Jeff Erickson, Damrong Guoy, John M. Sullivan +1
We present an algorithm to construct meshes suitable for space-time discontinuous Galerkin finite-element methods. Our method generalizes and improves the `Tent Pitcher' algorithm…
cs.CG2002
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
Michael Soss, Jeff Erickson, Mark Overmars
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into tw…